Quick-Sort (A, left, right) ifleft è right return else middle Partition (A, left, right) Quick-Sort (A, left, middle-1 ) Quick-Sort (A, middle+1, right) end if Partition (A, left, right) x - A[left]...

Q:During each iteration of Quick Sort algorithm, the first element of array is selected as a pivot. The algorithm for Quick Sort is given below. Modify it in such a way that last element of array should be selected as a pivot at each iteration. Also explain the advantages.

Extracted text: Quick-Sort (A, left, right) ifleft è right return else middle Partition (A, left, right) Quick-Sort (A, left, middle-1 ) Quick-Sort (A, middle+1, right) end if Partition (A, left, right) x - A[left] left for j if A[j] < x="" then="" left+1="" to="" right="" i="" -="" i="" +="" 1="" swap="" (a[i],="" a[j])="" end="" if="" end="" for="" j="" swap="" (a[i],="" a[left])="" return="">