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.
随便看	twin edge的意思 twin edger的意思 twine fringe的意思 twine guide plate的意思 twine harness的意思 twine heddle的意思 twine holder的意思 twine holder cleaner的意思 twine holder disc的意思 twine holder disk的意思 twine holder mechanism的意思 twine holder plate的意思 twine keeper的意思 twine knife的意思 twine knotter的意思 twin elbow的意思 twin electric horn的意思 twin electrode的意思 twin electrons的意思 twin element的意思 twin elements的意思 twin ell的意思 twine loss的意思 twine machine的意思 twin energy的意思