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

java - Play! framework 2.0: How to display multiple image? -

gmail - Is there any documentation for read-only access to the Google Contacts API? -

php - Controller/JToolBar not working in Joomla 2.5 -