News for hackers. Stuff that matters.

A comment on Big-O Algorithm Complexity Cheat Sheet. Parent comment

Re:Big-O Algorithm Complexity Cheat Sheet by kolistivra on Sunday May 05, 2013 @01:04PM (#5659005)
Randomized selection algoritm is actually O(N^2) in the worst case. Median of medians is the O(N) worst case selection algorithm.
[ Parent | on HN ]

There are no comments on this comment yet.