Return to Answer

• http://stackoverflow.com/questions/251781/how-to-find-the-kth-largest-element-in-an-unsorted-array-of-length-n-in-on — irrelevant (or rather, tangentially relevant, but does not contain the answer)
• http://stackoverflow.com/questions/10662013/finding-the-median-of-an-unsorted-array — the same question, asked 6 hours ago, on another Stack Exchange site
• http://en.wikipedia.org/wiki/Selection_algorithm — this article does have the answer, but it is a bit hard to follow if you aren't familiar with the topic.
• http://chinmaylokesh.wordpress.com/2011/03/01/order-statistics-general-find-the-kth-smallest-element-from-an-unsorted-array-in-linear-time-specific-find-median-of-unsorted-array-in-linear-time/ — has code, but defers to Wikipedia for an explanation, and besides this is a blog article that could go away at any time
• http://www.careercup.com/question?id=8462973 — another questions and answers site, where the answers (all unrated) contain such gems as “e do 1 parse of the array and make a Search tree out of it. This takes O(n) time.”

• https://stackoverflow.com/questions/251781/how-to-find-the-kth-largest-element-in-an-unsorted-array-of-length-n-in-on — irrelevant (or rather, tangentially relevant, but does not contain the answer)
• https://stackoverflow.com/questions/10662013/finding-the-median-of-an-unsorted-array — the same question, asked 6 hours ago, on another Stack Exchange site
• http://en.wikipedia.org/wiki/Selection_algorithm — this article does have the answer, but it is a bit hard to follow if you aren't familiar with the topic.
• http://chinmaylokesh.wordpress.com/2011/03/01/order-statistics-general-find-the-kth-smallest-element-from-an-unsorted-array-in-linear-time-specific-find-median-of-unsorted-array-in-linear-time/ — has code, but defers to Wikipedia for an explanation, and besides this is a blog article that could go away at any time
• http://www.careercup.com/question?id=8462973 — another questions and answers site, where the answers (all unrated) contain such gems as “e do 1 parse of the array and make a Search tree out of it. This takes O(n) time.”

This close reason is currently available on two Stack Exchange sites: English Language and Usage and Science Fiction and Fantasy. The return from experience is mixed: it's useful sometimes, but has a huge potential for abuse.

This close reason is currently available on two Stack Exchange sites: English Language and Usage and Science Fiction and Fantasy. The return from experience is mixed: it's useful sometimes, but has a huge potential for abuse.

This close reason is currently available on two Stack Exchange sites: English Language and Usage and Science Fiction and Fantasy. The return from experience is mixed: it's useful sometimes, but has a huge potential for abuse.

This close reason is currently available on two Stack Exchange sites: English Language and Usage and Science Fiction and Fantasy. The return from experience is mixed: it's useful sometimes, but has a huge potential for abuse.