The running time of quicksort can be improved in practice by taking advantage of the fast
running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a
subarray with fewer than k elements, let it simply return without sorting the subarray. After the
top-level call to quicksort returns, run insertion sort on the entire array to finish the sorting process.
標(biāo)簽：
running
advantage
quicksort
improved
上傳時(shí)間：
2013-12-01
上傳用戶：梧桐
