Step 1: Initialize low = l high = h key = a[(l+h)/2] Step 2: Repeat through step 7 while low <= high Step 3: Repeat step 4 while a[low]< key Step 4: low = low + 1; Step 5: Repeat step 6 while a[high] < key Step 6: high = high - 1 Step 7: if (low <= high) temp = a[low] a[low] = a[high] a[high] = temp low = low + 1 high = high - 1 Step 8: if (l < high ) Quick sort (a, l, high ); Step 9: if (low < high) Quick sort (a, low, h); Step 10: Exit