Question

Write and dry run the algotithm to find randomized select (which is basedon quick sort) on an array to find smallest element from the array.

Answer 1

Like Merge Sort, QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked ... Always pick last element as pivot (implemented below); Pick a random ... While traversing, if we find a smaller element, we swap current element with arr[i].