algorithm - Probability of RANDOMIZED-QUICKSORT exceed worst case -


the question clrs (exercise 12.4-5)

consider randomized-quicksort operating on sequence of n input numbers. prove constant k > 0, o(1/n^k) of n! input permutations yield o(n lg n) running time.

how can build model of worst case, , max bound of it.

you may want read this notes quick introduction. then, may read this (especially section 3.1) thorough explanation.


Comments

Popular posts from this blog

jquery - Invalid Assignment Left-Hand Side -

javascript - Preserving URL fragment through CAS sign-on -

asp.net mvc - Implementing normal user/pass, Twitter & Facebook auth -