題組內容

6.[Search and Sort: ]

(3) Prove that the best-case complexity of the quicksort method is O(n 1gn).