@article{williams1964algorithm,
  author = {Williams, J. W. J.},
  interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
  intrahash = {f485e4ea9a877871b59ab503151a7f10},
  journal = {Communications of the ACM},
  number = 6,
  pages = {347–348},
  title = {Algorithm 232: Heapsort},
  volume = 7,
  year = 1964
}

@article{wegener1993bottomupheapsort,
  author = {Wegener, Ingo},
  interhash = {1876a3b7aac290a08d7c855e50bcdfef},
  intrahash = {99f1ffe7091a547a5b1b4dc6f12a6a0c},
  journal = {Theoretical Computer Science},
  month = sep,
  number = 1,
  pages = {81-98},
  title = {BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)},
  volume = 118,
  year = 1993
}

@article{bollobas1996heapsort,
  author = {Bollobas, Bela and Fenner, Trevor I. and Frieze, Alan M.},
  interhash = {ee3290a0e1cdd114092029bde4f2346f},
  intrahash = {a740fbeb91288ba7d27b21f59a3ab7e6},
  journal = {Journal of Algorithms},
  month = mar,
  number = 2,
  pages = {205-217},
  title = {On the best case of heapsort},
  volume = 20,
  year = 1996
}

@article{williams1964algorithm,
  author = {Williams, J. W. J.},
  interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
  intrahash = {f485e4ea9a877871b59ab503151a7f10},
  journal = {Communications of the ACM},
  number = 6,
  pages = {347–348},
  title = {Algorithm 232: Heapsort},
  volume = 7,
  year = 1964
}

@article{williams1964algorithm,
  author = {Williams, J. W. J.},
  interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
  intrahash = {f485e4ea9a877871b59ab503151a7f10},
  journal = {Communications of the ACM},
  number = 6,
  pages = {347–348},
  title = {Algorithm 232: Heapsort},
  volume = 7,
  year = 1964
}

@article{bollobas1996heapsort,
  author = {Bollobas, Bela and Fenner, Trevor I. and Frieze, Alan M.},
  interhash = {ee3290a0e1cdd114092029bde4f2346f},
  intrahash = {a740fbeb91288ba7d27b21f59a3ab7e6},
  journal = {Journal of Algorithms},
  month = mar,
  number = 2,
  pages = {205-217},
  title = {On the best case of heapsort},
  volume = 20,
  year = 1996
}

@preprint{rehwald2013sorting,
  author = {Rehwald, Nils},
  editor = {none},
  interhash = {a6357fb61b878b15ada7f9b12e377b87},
  intrahash = {75db3afff346efe470df110924bb0986},
  title = {Sorting Algorithms and their behavior for Sorted input},
  year = 2013
}

@article{wegener1993bottomupheapsort,
  author = {Wegener, Ingo},
  interhash = {1876a3b7aac290a08d7c855e50bcdfef},
  intrahash = {99f1ffe7091a547a5b1b4dc6f12a6a0c},
  journal = {Theoretical Computer Science},
  month = sep,
  number = 1,
  pages = {81-98},
  title = {BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)},
  volume = 118,
  year = 1993
}

@article{carlsson1987variant,
  author = {Carlsson, Svante},
  interhash = {dbf90c28ff8293fee436d214e62254ba},
  intrahash = {4981e17b5c56a44cada07899baf9a791},
  journal = {Information Processing Letters},
  number = 4,
  pages = {247-250},
  publisher = {Elsevier},
  title = {A variant of heapsort with almost optimal number of comparisons},
  volume = 24,
  year = 1987
}

@article{schaffer1993analysis,
  author = {Schaffer, Russel and Sedgewick, Robert},
  interhash = {40b92ad6147010e002ad4bdf6eaf0e7b},
  intrahash = {2bd2387d2b6ef2317fdbfff15b27b952},
  journal = {Journal of Algorithms},
  month = jul,
  number = 1,
  pages = {76-100},
  publisher = {Academic Press},
  title = {The analysis of heapsort},
  volume = 15,
  year = 1993
}

@article{journals/cacm/Pohl72,
  author = {Pohl, Ira},
  ee = {http://doi.acm.org/10.1145/361405.361423},
  interhash = {e416f828bdb17572e992e2afc6e5c3b0},
  intrahash = {bd02d51c6007ff442d76dd9ec005be91},
  journal = {Commun. ACM},
  number = 6,
  pages = {462-464},
  title = {A Sorting Problem and Its Complexity.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Pohl72},
  volume = 15,
  year = 1972
}

@article{Floyd64a,
  author = {Floyd, Robert W.},
  ee = {http://doi.acm.org/10.1145/355588.365103},
  interhash = {d7468ef11591a6c9e607d43428e2d69d},
  intrahash = {c25787586d5cf013bb10f2e67b167820},
  journal = {Commun. ACM},
  number = 12,
  pages = 701,
  title = {Algorithm 245: Treesort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm7.html#Floyd64a},
  volume = 7,
  year = 1964
}

@article{williams1964algorithm,
  author = {Williams, J. W. J.},
  interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
  intrahash = {f485e4ea9a877871b59ab503151a7f10},
  journal = {Communications of the ACM},
  number = 6,
  pages = {347–348},
  title = {Algorithm 232: Heapsort},
  volume = 7,
  year = 1964
}

@article{Musser:1997:ISS:261387.261395,
  acmid = {261395},
  address = {New York, NY, USA},
  author = {Musser, David R.},
  doi = {10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#},
  interhash = {e2eb9a859abb44066bb771e742225e8a},
  intrahash = {2a7233c1bb07caed5327314447ca90d0},
  issn = {0038-0644},
  issue_date = {Aug. 1997},
  journal = {Softw. Pract. Exper.},
  month = aug,
  number = 8,
  numpages = {11},
  pages = {983--993},
  publisher = {John Wiley \& Sons, Inc.},
  title = {Introspective sorting and selection algorithms},
  url = {http://dx.doi.org/10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#},
  volume = 27,
  year = 1997
}

@article{Schaffer:1993:AH:159277.159281,
  acmid = {159281},
  address = {Duluth, MN, USA},
  author = {Schaffer, Russel and Sedgewick, Robert},
  doi = {10.1006/jagm.1993.1031},
  interhash = {40b92ad6147010e002ad4bdf6eaf0e7b},
  intrahash = {124caf5581da878730d8b76a362eb964},
  issn = {0196-6774},
  issue_date = {July 1993},
  journal = {J. Algorithms},
  month = jul,
  number = 1,
  numpages = {25},
  pages = {76--100},
  publisher = {Academic Press, Inc.},
  title = {The analysis of heapsort},
  url = {http://dx.doi.org/10.1006/jagm.1993.1031},
  volume = 15,
  year = 1993
}

@article{floyd1964algorithm,
  author = {Floyd, Robert W.},
  interhash = {baf7da69dff2f4d24c091a9deb2f7bdb},
  intrahash = {328f6c23a972d5bbe4bcb754011d6d16},
  journal = {Communications of the ACM},
  month = dec,
  number = 12,
  pages = 701,
  title = {Algorithm 245: Treesort 3},
  volume = 7,
  year = 1964
}

@article{williams1964algorithm,
  author = {Williams, J. W. J.},
  interhash = {88f7b4bad2300e0db2fab61c269e1f4e},
  intrahash = {f485e4ea9a877871b59ab503151a7f10},
  journal = {Communications of the ACM},
  month = jun,
  number = 6,
  pages = {347-348},
  title = {Algorithm 232: Heapsort},
  volume = 7,
  year = 1964
}