Article thumbnail
Location of Repository

A lower bound for the worst case of bottom-up-heapsort

By Rudolf Fleischer, B. P. Sinha and Christian Uhrig


Bottom-Up-Heapsort ia a variant of Heapsort. Till now, its worst case complexity or the number of comparisons is known to be bounded above by 1.5nlog n+O(n), where n is the number of elements to be sorted; but it was conjectured to be nlog n+O(n). In this paper we give a construction that proves an asymptotic lower bound of 1.25nlog n-O(nlog log n) comparisons for the worst case

Topics: Data processing Computer science
Publisher: Fakultät 6 - Naturwissenschaftlich-Technische Fakultät I. Fachrichtung 6.2 - Informatik
Year: 1990
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://scidok.sulb.uni-saarlan... (external link)
  • http://scidok.sulb.uni-saarlan... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.