{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T08:38:35Z","timestamp":1762504715282},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7259,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0304-3975(93)90364-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"81-98","source":"Crossref","is-referenced-by-count":40,"title":["BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT beating, on an average, QUICKSORT (if n is not very small)"],"prefix":"10.1016","volume":"118","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90364-Y_BIB1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","article-title":"A variant of HEAP SORT with almost optimal number of comparisons","volume":"24","author":"Carlsson","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90364-Y_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01937350","article-title":"Average-case results on HEAPSORT","volume":"27","author":"Carlsson","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264353","article-title":"Deleting the root of a heap","volume":"17","author":"Doberkat","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90364-Y_BIB4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(84)80053-4","article-title":"An average case analysis of Floyd's algorithm to construct heaps","volume":"61","author":"Doberkat","year":"1984","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB5","series-title":"A tight lower bound for the worst case of Bottom-up-Heapsort","author":"Fleischer","year":"1991"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB6","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245","volume":"7","author":"Floyd","year":"1964","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(93)90364-Y_BIB8","unstructured":"R. Kemp, personal communication, 1989."},{"key":"10.1016\/0304-3975(93)90364-Y_BIB9","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1981"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB10","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","article-title":"Building heaps fast","volume":"10","author":"McDiarmid","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB11","series-title":"The analysis of HEAPSORT","author":"Schaffer","year":"1991"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF00289467","article-title":"The analysis of Quicksort programs","volume":"7","author":"Sedgewick","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(93)90364-Y_BIB13","series-title":"One Hundred Problems in Elementary Mathematics","author":"Steinhaus","year":"1958"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB14","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/362736.362753","article-title":"Increasing the efficiency of QUICKSORT","volume":"13","author":"van Emden","year":"1970","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB15","series-title":"Proc. MFCS '90","first-page":"516","article-title":"BOTTOM-UP-HEAP SORT, a new variant of HEAP SORT beating on average QUICK SORT (if n is not very small)","volume":"Vol. 452","author":"Wegener","year":"1990"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB16","series-title":"Proc. STACS '91","first-page":"137","article-title":"The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP-HEAP SORT is less than n log n+1.1n","volume":"Vol. 480","author":"Wegener","year":"1991"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB17","first-page":"347","article-title":"Algorithm 232","author":"Williams","year":"1964","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(93)90364-Y_BIB18","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1093\/comjnl\/33.3.281","article-title":"A new HEAPSORT algorithm and the analysis of its complexity","volume":"33","author":"Xunrang","year":"1990","journal-title":"Comput. J."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390364Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390364Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:24:17Z","timestamp":1555129457000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390364Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["030439759390364Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90364-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}