In your analysis, you may assume that sequential sorting of "n" keys
takes O(n log n) time, even if you use the quicksort [qsort()]
function.