Smoothsort

In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of O(n log n), but it is not a stable sort. The advantage of smoothsort is that it comes closer to O(n) time if the input is already sorted to some degree, whereas heapsort averages O(n log n) regardless of the initial sorted state.

单词	Smoothsort
释义	Smoothsort 英语百科 Smoothsort In computer science, smoothsort is a comparison-based sorting algorithm. A variant of heapsort, it was invented and published by Edsger Dijkstra in 1981. Like heapsort, smoothsort is an in-place algorithm with an upper bound of O(n log n), but it is not a stable sort. The advantage of smoothsort is that it comes closer to O(n) time if the input is already sorted to some degree, whereas heapsort averages O(n log n) regardless of the initial sorted state.
随便看	Friday The Thirteenth Fridaythorpe Friday wear friddle Fridelander disease fridel oscillation fridenberg chart Fridenberg test Fridenberg test card Fridereich disease Friderichsen Friderichsen test Friderichsen test letter Friderichsen Waterhouse syndrome Fridericia equation Fridericia method Fridericianum fridericianums frideron fridg fridge freezer fridge freezers fridgeful fridgefuls fridge Googling