Rajan_sust's blog

Expected Value of Quicksort
By Rajan_sust, history, 6 years ago, In English

In computer science, the randomized quicksort algorithm has expected runtime O(nlogn). How does linearity of expectation allow us to show this?

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
6 years ago, # |
  Vote: I like it 0 Vote: I do not like it

here is a proof: https://www.cs.cmu.edu/~avrim/451f11/lectures/lect0906.pdf

→ Reply