Sort the sequence of numbers < 8,2,4,9,6> by performing the following algorithm. You can repeat several...

 

Transcribed Image Text:

Sort the sequence of numbers < 8,2,4,9,6> by performing the following algorithm. You can repeat several times as needed. (20P) Partition (A,p,q) // A[p,..., q] x+ A[q] i+q for j q 1 to p do if A[j] x then ii-1 exchange A[i] A[j] exchange A[q] A[i] return i Sort the sequence of numbers < 8,2,4,9,6> by performing the following algorithm. You can repeat several times as needed. (20P) Partition (A,p,q) // A[p,..., q] x+ A[q] i+q for j q 1 to p do if A[j] x then ii-1 exchange A[i] A[j] exchange A[q] A[i] return i