出典:Wikipedia
出典:『Wikipedia』 (2011/06/28 15:22 UTC 版)
Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family. Although somewhat slower in practice on most machines than a well implemented quicksort, it has the advantage of a more favorable worst-case O(n log n) runtime. Heapsort is an in-place algorithm, but is not a stable sort.
![]()
The troops march past―file off.
the muster-roll
to alter the arrangement
to break up the ranks
to reduce anything to order―systematize―methodize
the act of putting in order
quarter-binding
quarter-binding