Heapsort (5493 bytes)
1: ...iring only a constant amount of additional space. Heapsort is not a [[stable sort]].
12: ... Ternary heapsort is about 12% faster than binary heapsort.
15: Heapsort primarily competes with [[quicksort]], another ve...
21: ...ints or systems concerned with security often use heapsort.
23: ...[[disk storage]] or [[network attached storage]]. Heapsort shares none of these benefits; in particular, it ...

Smoothsort (444 bytes)
1: ...sort''' [[sorting algorithm]] is a variation of [[heapsort]] developed by [[Edsger Dijkstra]] in [[1981]]. T...

Introsort (2003 bytes)
1: ...997. It begins with [[quicksort]], switching to [[heapsort]] once the recursion depth exceeds a preset value...
5: ...rt approach with the recursion depth to switch to heapsort passed as a parameter, median-of-3 pivot selectio...

Work-in-place (1216 bytes)
10: * [[Heapsort]]

Heap (1542 bytes)
13: Heaps are used in the sorting algorithm called [[heapsort]].

Space-time tradeoff (1865 bytes)
7: ...em, all-around better algorithms exist, such as [[heapsort]], which combines the good qualities of bubble so...

Insertion sort (5944 bytes)
2: ...more advanced algorithms such as [[quicksort]], [[heapsort]], or [[merge sort]], but its advantages are:
69: [[Heapsort]] is another high speed sort algorithm, which is ...

Selection sort (3309 bytes)
15: [[Heapsort]] greatly improves the basic algorithm by using a...

Big O notation (10992 bytes)
6: ...see [[sum]]''), analyzing [[algorithm]]s (''see [[heapsort]]''), and for defining terms in [[computational c...
193: For example, one might say "[[heapsort]] is O(''n'' log ''n'') in the
194: average case" when the intended meaning was "[[heapsort]] is

Sorting algorithm (11771 bytes)
42: * [[Heapsort]] — O(''n'' log ''n'')
69: ===Heapsort===
70: ...''O(n''^{<small>2</small>}'')'' time, but Heapsort accomplishes its task efficiently by using a data...

Graham scan (3254 bytes)
7: ...lgorithm]] is appropriate for this, for example [[heapsort]] (which is O(''n'' log ''n'')). In order to spe...

Binary heap (5440 bytes)
80: ...re. This approach is particularly useful in the [[heapsort]] algorithm, where it allows the space in the inp...

Radix sort (4571 bytes)
6: ...r high performance [[sorting algorithm]]s (like [[heapsort]] and [[mergesort]]) which require O(''n'' · lg '...

Quicksort (17297 bytes)
47: ...orse than comparable sorting algorithms such as [[heapsort]] or [[merge sort]]. However, if pivots are chose...
86: ...would do well to also consider [[introsort]] or [[heapsort]] instead.
104: ...t]]. This starts with quicksort and switches to [[heapsort]] when the recursion depth exceeds a preset value...
108: ...nt of Quicksort uses O(log ''n'') space. However, heapsort requires efficient random access to be practical.

Timeline of algorithms (6031 bytes)
32: * [[1964]] - [[Heapsort]] developed by [[J. W. J. Williams]]

List of algorithms (12112 bytes)
59: * [[Heapsort]]: convert the list into a heap, keep removing th...

Linked list (34905 bytes)
65: ...ook up an element by its index quickly, such as [[heapsort]]. Sequential access on arrays is also faster tha...

List of terms relating to algorithms and data structures (29589 bytes)
517: * [[heapsort]]

<< Prev 20 Result Pages:   1  2  3  4  5  6  7  8  9  10  Next 20 >>