Find a number in unsorted array larger than the median number with complexity better than O(1/2n+1)
Given an unsorted array with N positive integers.
Find a number in the array, that is larger than the median number in the array.
for example if the array contains numbers between 1-10, the median is 5, so 6+ is acceptable.
This can be done with O(1/2n+1) which is less than O(N), by looping through 51% of the array and getting the maximum number.
But how can you do it with a better complexity?
computational-complexity
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Given an unsorted array with N positive integers.
Find a number in the array, that is larger than the median number in the array.
for example if the array contains numbers between 1-10, the median is 5, so 6+ is acceptable.
This can be done with O(1/2n+1) which is less than O(N), by looping through 51% of the array and getting the maximum number.
But how can you do it with a better complexity?
computational-complexity
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Given an unsorted array with N positive integers.
Find a number in the array, that is larger than the median number in the array.
for example if the array contains numbers between 1-10, the median is 5, so 6+ is acceptable.
This can be done with O(1/2n+1) which is less than O(N), by looping through 51% of the array and getting the maximum number.
But how can you do it with a better complexity?
computational-complexity
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Given an unsorted array with N positive integers.
Find a number in the array, that is larger than the median number in the array.
for example if the array contains numbers between 1-10, the median is 5, so 6+ is acceptable.
This can be done with O(1/2n+1) which is less than O(N), by looping through 51% of the array and getting the maximum number.
But how can you do it with a better complexity?
computational-complexity
computational-complexity
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 3 at 23:01
Ben Beri
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked Jan 3 at 23:01
Ben Beri
101
asked Jan 3 at 23:01
Ben Beri
101
101
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Ben Beri is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
That's actually untrue. For example, if the array contains 9 occurrences of the number 1 and a single 2. Selecting 51% of the data will likely have a maximum value of 1, which is equal to the median of 1 - not greater.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
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
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Ben Beri is a new contributor. Be nice, and check out our Code of Conduct.
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%2fmath.stackexchange.com%2fquestions%2f3061122%2ffind-a-number-in-unsorted-array-larger-than-the-median-number-with-complexity-be%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
That's actually untrue. For example, if the array contains 9 occurrences of the number 1 and a single 2. Selecting 51% of the data will likely have a maximum value of 1, which is equal to the median of 1 - not greater.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
That's actually untrue. For example, if the array contains 9 occurrences of the number 1 and a single 2. Selecting 51% of the data will likely have a maximum value of 1, which is equal to the median of 1 - not greater.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
That's actually untrue. For example, if the array contains 9 occurrences of the number 1 and a single 2. Selecting 51% of the data will likely have a maximum value of 1, which is equal to the median of 1 - not greater.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
That's actually untrue. For example, if the array contains 9 occurrences of the number 1 and a single 2. Selecting 51% of the data will likely have a maximum value of 1, which is equal to the median of 1 - not greater.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered Jan 3 at 23:22
Peter Foreman
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
answered Jan 3 at 23:22
Peter Foreman
2056
answered Jan 3 at 23:22
Peter Foreman
2056
2056
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Peter Foreman is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
Ben Beri is a new contributor. Be nice, and check out our Code of Conduct.
Ben Beri is a new contributor. Be nice, and check out our Code of Conduct.
Ben Beri is a new contributor. Be nice, and check out our Code of Conduct.
Ben Beri is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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.
Use MathJax to format equations. MathJax reference.
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%2fmath.stackexchange.com%2fquestions%2f3061122%2ffind-a-number-in-unsorted-array-larger-than-the-median-number-with-complexity-be%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
