Talk:Partial sorting

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

???

This article has not yet received a rating on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Using binary heap and breadth-first search[edit]

Hi Qwertyus. Nice article but it seems that the algorithm described in section "Data structure-based solutions" which uses binary heap and breadth-first search will not work. As an example I did not manage to find the third minimal element in the following min-heap using this algorithm (it must be 3 but I get 100):

1

2 100

3 4 200 300

Is something wrong in my understanding the algorithm? — Preceding unsigned comment added by Mpoleg (talk • contribs) 09:36, 26 October 2012 (UTC)[reply]

I didn't write any of this. I just moved the content from Selection algorithm, which was getting too long. Qwertyus (talk) 10:20, 26 October 2012 (UTC)[reply]

In the section: Direct application of the linear-time selection algorithm[edit]

"The linear-time selection algorithm described above can be used to find the k smallest or the k largest elements in worst-case linear time O(n)." appears to refer to something from another article, but no reference is given. — Preceding unsigned comment added by JamesHirschorn (talk • contribs) 17:50, 4 March 2013 (UTC)[reply]