0 votes 0 votes consider modifying partitioning procedure of quicksort by randomly picking up three elements from array and computing their median(middle of 3 elts). Approximate probablility of getting at worst ab a to (1-a) split in the range 0<a<1? gate_forum asked Dec 19, 2015 gate_forum 271 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.