Time complexity and number of elements operated on
up vote
0
down vote
favorite
Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.
Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.
Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?
algorithm time-complexity big-o
edited Nov 10 at 23:03
Scott Hunter
33k64070
asked Nov 10 at 22:55
erykkk
466
add a comment |
up vote
0
down vote
favorite
Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.
Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.
Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?
algorithm time-complexity big-o
edited Nov 10 at 23:03
Scott Hunter
33k64070
asked Nov 10 at 22:55
erykkk
466
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.
Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.
Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?
algorithm time-complexity big-o
edited Nov 10 at 23:03
Scott Hunter
33k64070
asked Nov 10 at 22:55
erykkk
466
Algorithm A executes an operation of time complexity O(log n) on an array storing n elements.
Algorithm B chooses log n elements from an array, and performs an O(n) calculation on each.
Since d(n) = O(f(n)) and e(n) = O(g(n)), then d(n)*e(n) = O(f(n)*g(n)), does that mean that algorithms A and B both have a time complexity of O(n log n)?
algorithm time-complexity big-o
algorithm time-complexity big-o
edited Nov 10 at 23:03
Scott Hunter
33k64070
asked Nov 10 at 22:55
erykkk
466
edited Nov 10 at 23:03
Scott Hunter
33k64070
asked Nov 10 at 22:55
erykkk
466
edited Nov 10 at 23:03
Scott Hunter
33k64070
edited Nov 10 at 23:03
Scott Hunter
33k64070
edited Nov 10 at 23:03
Scott Hunter
33k64070
33k64070
asked Nov 10 at 22:55
erykkk
466
asked Nov 10 at 22:55
erykkk
466
asked Nov 10 at 22:55
erykkk
466
466
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
up vote
2
down vote
The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.
answered Nov 10 at 23:03
Charlie
5812826
add a comment |
up vote
1
down vote
Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.
answered Nov 10 at 23:02
Scott Hunter
33k64070
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53244224%2ftime-complexity-and-number-of-elements-operated-on%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
2
down vote
The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.
answered Nov 10 at 23:03
Charlie
5812826
add a comment |
up vote
2
down vote
The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.
answered Nov 10 at 23:03
Charlie
5812826
add a comment |
up vote
2
down vote
up vote
2
down vote
The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.
answered Nov 10 at 23:03
Charlie
5812826
The algorithm A has a time complexity of O(log n) and the algorithm B has a time complexity of O(n * log n). Algorithm B calculates something with O(n) on log * n elements. I assume that choosing is equivalent to sorting.
answered Nov 10 at 23:03
Charlie
5812826
answered Nov 10 at 23:03
Charlie
5812826
answered Nov 10 at 23:03
Charlie
5812826
answered Nov 10 at 23:03
Charlie
5812826
5812826
add a comment |
add a comment |
up vote
1
down vote
Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.
answered Nov 10 at 23:02
Scott Hunter
33k64070
add a comment |
up vote
1
down vote
Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.
answered Nov 10 at 23:02
Scott Hunter
33k64070
add a comment |
up vote
1
down vote
up vote
1
down vote
Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.
answered Nov 10 at 23:02
Scott Hunter
33k64070
Assuming that B doesn't take too long to choose the elements, and you meant Algorithm A does O(log n) work on each element, yes.
answered Nov 10 at 23:02
Scott Hunter
33k64070
answered Nov 10 at 23:02
Scott Hunter
33k64070
answered Nov 10 at 23:02
Scott Hunter
33k64070
answered Nov 10 at 23:02
Scott Hunter
33k64070
33k64070
add a comment |
add a comment |
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53244224%2ftime-complexity-and-number-of-elements-operated-on%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
