Traditionally deterministic algorithm for quicksort is used which gives O (n log n) running time for an average case and O (n2) for the worst case, where n is the number of elements to be sorted. If a randomized approach ...