Selection algorithm: Difference between revisions

Content deleted Content added
Line 77:
:<math>W_{t}(n) \leq n - t + \sum_{n+1-t < j \leq n} \lceil{\log_2\, j}\rceil \quad \text{for}\, n \geq t</math>
 
This bound is achievable for ''t''=2 but better, more complex bounds are known for larger ''t'' [?reference].
 
== Space complexity ==