Ask
Login
0
6.9kviews
Explain randomized version of Quick sort and derive its complexity.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.1 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
2
277views
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k
  • In the randomized version of Quick sort we impose a distribution on input.
  • This does not improve the worst-case running time independent of the input ordering.
  • In this version we choose a random key for the pivot.
  • Assume that procedure Random (a, b) returns a random integer in the range …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.