What is the best algorithm to find the minimum element in max heap?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box;
}
What is the best algorithm(in terms of time complexity) to find the minimum element in max heap?
arrays heap max-heap
asked Nov 23 '18 at 19:25
user9864052user9864052
32
add a comment |
What is the best algorithm(in terms of time complexity) to find the minimum element in max heap?
arrays heap max-heap
asked Nov 23 '18 at 19:25
user9864052user9864052
32
1
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36
add a comment |
What is the best algorithm(in terms of time complexity) to find the minimum element in max heap?
arrays heap max-heap
asked Nov 23 '18 at 19:25
user9864052user9864052
32
What is the best algorithm(in terms of time complexity) to find the minimum element in max heap?
arrays heap max-heap
arrays heap max-heap
asked Nov 23 '18 at 19:25
user9864052user9864052
32
asked Nov 23 '18 at 19:25
user9864052user9864052
32
edited Nov 24 '18 at 2:24
user9864052
asked Nov 23 '18 at 19:25
user9864052user9864052
32
asked Nov 23 '18 at 19:25
user9864052user9864052
32
asked Nov 23 '18 at 19:25
user9864052user9864052
32
32
1
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36
add a comment |
1
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36
1
1
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36
add a comment |
1 Answer
1
active
oldest
votes
The minimum element in a max-heap is guaranteed to be in the last (n/2 + 1) items, where n is the number of items in the heap. So the best way to find it is to do a sequential scan of the last n/2 items. Consider, for example, a heap with 5 items:
5
4 1
3 2
The smallest item will never have children, so it must be either on the bottom row of the heap, or on the next row up.
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
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',
autoActivateHeartbeat: false,
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%2f53452030%2fwhat-is-the-best-algorithm-to-find-the-minimum-element-in-max-heap%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
The minimum element in a max-heap is guaranteed to be in the last (n/2 + 1) items, where n is the number of items in the heap. So the best way to find it is to do a sequential scan of the last n/2 items. Consider, for example, a heap with 5 items:
5
4 1
3 2
The smallest item will never have children, so it must be either on the bottom row of the heap, or on the next row up.
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
add a comment |
The minimum element in a max-heap is guaranteed to be in the last (n/2 + 1) items, where n is the number of items in the heap. So the best way to find it is to do a sequential scan of the last n/2 items. Consider, for example, a heap with 5 items:
5
4 1
3 2
The smallest item will never have children, so it must be either on the bottom row of the heap, or on the next row up.
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
add a comment |
The minimum element in a max-heap is guaranteed to be in the last (n/2 + 1) items, where n is the number of items in the heap. So the best way to find it is to do a sequential scan of the last n/2 items. Consider, for example, a heap with 5 items:
5
4 1
3 2
The smallest item will never have children, so it must be either on the bottom row of the heap, or on the next row up.
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
The minimum element in a max-heap is guaranteed to be in the last (n/2 + 1) items, where n is the number of items in the heap. So the best way to find it is to do a sequential scan of the last n/2 items. Consider, for example, a heap with 5 items:
5
4 1
3 2
The smallest item will never have children, so it must be either on the bottom row of the heap, or on the next row up.
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
answered Nov 26 '18 at 0:03
Jim MischelJim Mischel
108k12134254
108k12134254
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.
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%2f53452030%2fwhat-is-the-best-algorithm-to-find-the-minimum-element-in-max-heap%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
1
Hello and welcome to Stackoverflow! You may want to provide some parameters for use as part of evaluating "best" since it is very subjective and there are different ways one algorithm could be better than another. If time or amount of resources required are what you are interested in using to evaluate "best" please specify which you are interested in using.
– Brandon Haugen
Nov 23 '18 at 20:36