Suppose that in Quicksort the pivot is the average of all keys.(Assuming the keys are numeric) Will this guarantee balance partitioning and therefore Θ(nlgn) complexity? Please explain.
Thanks
Quick Sort Picking a pivot? Average of all the keys
Started by ductiletoaster, Mar 30 2011 06:44 PM
1 reply to this topic
1 user(s) are reading this topic
0 members, 1 guests, 0 anonymous users


Sign In
Create Account


Back to top









