Heapsort

Known as: Heap, Heap sort 
In computer science, heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like that algorithm… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
The development of sorting routines is a well trodden path.” [DF88, p. 66] We proceed by program transformation to derive a… (More)
Is this relevant?
2005
2005
  • Lei Yang
  • IEEE Transactions on Pattern Analysis and Machine…
  • 2005
Isometric data embedding requires construction of a neighborhood graph that spans all data points so that geodesic distance… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2003
2003
With the emergence of a plethora of embedded and portable applications, energy dissipation has joined throughput, VLSI layout… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2002
2002
With refinements to the <i>WEAK-HEAPSORT</i> algorithm we establish the general and practical relevant sequential sorting… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
A heap structure designed for secondary storage is suggested that tries to make the best use of the available buffer space in… (More)
Is this relevant?
1999
1999
Dutton (1993) presents a further HEAPSORT variant called WEAK-HEAPSORT, which also contains a new data structure for priority… (More)
  • figure 1
  • figure 2
Is this relevant?
1998
1998
A variant of Heapsort|named Ultimate Heapsort|is presented that sorts n elements in-place in (n log 2 (n + 1)) worst-case time by… (More)
Is this relevant?
1996
1996
Although discovered some 30 years ago, the Heapsort algorithm is still not completely understood. Here we investigate the best… (More)
  • figure 1
Is this relevant?
1992
1992
The performance of Heapsort algorithms on arbitrary input is examined. It is proved that ann logn−O(n) lower bound on the number… (More)
Is this relevant?
1983
1983
The results from the computat]onal testmg of an algorithm designed to solve large-scale multiplechoice knapsack problems are… (More)
  • table I
Is this relevant?