Answer to Question #283854 in C++ for tayyaba

Question

Assume the following list of keys: 16, 38, 54, 80, 22, 65, 55, 48, 64, 95, 5,

100, 58, 25, 36

This list is to be sorted using quicksort as discussed in this chapter. Use

pivot as the middle element of the list.

a. Give the resulting list after one call to the partition procedure.

b. Give the resulting list after two calls to the partition procedure

Answer 1

a. 16 38 80 22 65 55 48 64 95 5 100 58 25 36 54

b. 16 38 80 22 54 55 48 64 95 5 65 58 25 100 36