Dry run “quick sort” algorithm on following data (use standardpartition function), Show
different stages of sorting process using trees or using array sothat array contents and changes
are visible.
Data: {3,1, 5, 6, 8, 26, 4,3 6, 46, 9}![function Partition (A, 1,r) Procedure QuickSort (A,l,r) repeat if (r>) then partition (A,l, QuickSort (A,I.j-1); QuickSort (A,j+1,r); r); repeat i = i + l ; until (a[ i] >-v) or (i > n); repeat j-j-; until (ajlor(2) if (ij) then swap (a[ i , aljD until j-i end of if. return (j)](https://d2vlcm61l7u1fs.cloudfront.net/media%2F9c9%2F9c9f5dff-54c8-45d8-8278-277e4b8d6a90%2Fphp4kzMdk.png)
function Partition (A, 1,r) Procedure QuickSort (A,l,r) repeat if (r>)
PayPal Gateway not configured
PayPal Gateway not configured