(b) [5 points] Given an integer array A of size n, the following pseudo-code shows the quick-sort algorithm. Note that we assume that all array elements in A are distinct and the function medi um(2) will return the value x in A such that the number of integers that are larger than x is equal to the number of integers that are smaller than x. Besides, we assume that the running time of the function medi um(A) is O(r). Derive the worst case running time of quicksort (A) in terms of big-0 notation. (Note that you will get O points if you just give the answer directly.)
阿摩線上測驗
登入