A standard Quicksort implementation is absolutely worst-case O(N^2). Variants do...

		thurn on March 19, 2014 \| parent \| context \| favorite \| on: Lessons from a Silicon Valley job search A standard Quicksort implementation is absolutely worst-case O(N^2). Variants do exist like median-of-medians quicksort or introsort, but I would never describe O(N^2) as wrong. In fact, I would be very happy if candidates knew the difference between worst-case and average-case analysis.