Content deleted Content added
Line 20:
=== Selection ===
The selection problem is to find an item in an unordered list <math>A</math> of size <math>N</math>which is bigger than <math>k-1</math> other elements in <math>A</math>.
{{Collapse|1=
The code makes use of <code>PRAMSORT</code> which is a PRAM optimal sorting algorithm which runs in <math>O(\log N)</math>, and <code>SELECT</code>, which is a cache optimal single-processor selection algorithm.
| |||