In Quicksort algorithm, there are two recursive calls to itself  after PARTITION, the left subarray is recursively sorted and then the right subarray. How will you modify Quicksort algorithm so that the second recursive call on the right subarray can be avoided, but sorted correctly.
