C++ help with homework:
A) Suppose that the list of keys is as given in Exercise 3. Use the quick sort algorithm, as discussed in this chapter, to determine the number of times the function partition is called to completely sort the list.
List Key from Exercise: 4, 16 28, 36, 48, 64, 69, 80, 84, 92, 148, 150
I am not sure how to do this one