Your version is false. Randomized quick sort provides expected time O(nlogn). But in worst case it can be near quadratic time. However, in practice is can be solved using random shuffling.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
