Talk:Partial sorting
Add topic | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | |||||||||||||||||
| ||||||||||||||||||
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)
- 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)
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)