{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:56:04Z","timestamp":1774421764359,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2007,11,1]],"date-time":"2007-11-01T00:00:00Z","timestamp":1193875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s11390-007-9106-7","type":"journal-article","created":{"date-parts":[[2007,11,17]],"date-time":"2007-11-17T03:02:53Z","timestamp":1195268573000},"page":"898-903","source":"Crossref","is-referenced-by-count":8,"title":["An Improved HEAPSORT Algorithm with nlogn\u2009\u2212\u20090.788928n Comparisons in the Worst Case"],"prefix":"10.1007","volume":"22","author":[{"given":"Xiao-Dong","family":"Wang","sequence":"first","affiliation":[]},{"given":"Ying-Jie","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,17]]},"reference":[{"key":"9106_CR1","volume-title":"The Art of Computer Programming \u2014 Sorting and Searching","author":"D E Knuth","year":"1998","unstructured":"Knuth D E. The Art of Computer Programming \u2014 Sorting and Searching. 2nd Edition, New York: Addison Wesley, 1998.","edition":"2"},{"issue":"4","key":"9106_CR2","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R W Floyd","year":"1964","unstructured":"Floyd R W. Algorithm 245: Treesort 3. Communications of the ACM, 1964, 7(4): 701.","journal-title":"Communications of the ACM"},{"issue":"4","key":"9106_CR3","first-page":"347","volume":"7","author":"J W J Williams","year":"1964","unstructured":"Williams J W J. Algorithm 232: HEAPSORT. Communications of the ACM, 1964, 7(4): 347\u2013348.","journal-title":"Communications of the ACM"},{"issue":"1","key":"9106_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0304-3975(93)90364-Y","volume":"118","author":"I Wegener","year":"1993","unstructured":"Wegener I. BOTTOM-UP-HEAPSORT, a new variant of HEAPSORT, beating on an average, QUICKSORT (if n is not very small). Theoretical Computer Science, 1993, 118(1): 81\u201398.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9106_CR5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","volume":"24","author":"S Carlsson","year":"1987","unstructured":"Carlsson S. A variant of HEAPSORT with almost optimal number of comparisons. Information Processing Letters, 1987, 24(3): 247\u2013250.","journal-title":"Information Processing Letters"},{"issue":"1","key":"9106_CR6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0890-5401(92)90005-Z","volume":"97","author":"I Wegener","year":"1992","unstructured":"Wegener I. The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n\u2009+\u20091.1n. Information and Computation, 1992, 97(1): 86\u201396.","journal-title":"Information and Computation"},{"issue":"6","key":"9106_CR7","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G H Gonnet","year":"1986","unstructured":"Gonnet G H, Munro J I. Heaps on heaps. SIAM Journal on Computing, 1986, 15(6): 964\u2013971.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"9106_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C J H McDiarmid","year":"1989","unstructured":"McDiarmid C J H, Reed B A. Building heaps fast. Journal of Algorithms, 1989, 10(3): 352\u2013365.","journal-title":"Journal of Algorithms"},{"key":"9106_CR9","doi-asserted-by":"crossref","unstructured":"Hoare C A R. Quicksort. Computer Journal, 5(1): 10\u201315.","DOI":"10.1093\/comjnl\/5.1.10"},{"issue":"3","key":"9106_CR10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R D Dutton","year":"1993","unstructured":"Dutton R D. Weak heap sort. BIT, 1993, 33(3): 372\u2013381.","journal-title":"BIT"},{"issue":"1","key":"9106_CR11","first-page":"1","volume":"7","author":"S Edelkamp","year":"2002","unstructured":"Edelkamp S, Stiegeler P. Implementing HEAPSORT with n log n\u2009\u2212\u20090.9n and QUICKSORT with n log n\u2009+\u20090.2n comparisons. ACM Journal of Experimental Algorithmics (JEA), 2002, 7(1): 1\u201320.","journal-title":"ACM Journal of Experimental Algorithmics (JEA)"},{"issue":"1","key":"9106_CR12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0304-3975(01)00288-2","volume":"285","author":"D Cantone","year":"2002","unstructured":"Cantone D, Cincotti G. QuickHeapsort, an efficient mix of classical sorting algorithms. Theoretical Computer Science, 2002, 285(1): 25\u201342.","journal-title":"Theoretical Computer Science"},{"key":"9106_CR13","unstructured":"Carlsson S, Chen J. The complexity of heaps. In Proc. the Third Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, October 1992, pp.393\u2013402."},{"issue":"1","key":"9106_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02238646","volume":"49","author":"Y Ding","year":"1992","unstructured":"Ding Y, Weiss M A. Best case lower bounds for Heapsort. Computing, 1992, 49(1): 1\u20139.","journal-title":"Computing"},{"issue":"1","key":"9106_CR15","first-page":"14","volume":"3608","author":"Z Li","year":"2005","unstructured":"Z Li, Bruce A Reed. Heap building bounds. LNCS, 2005, 3608(1): 14\u201323.","journal-title":"LNCS"},{"issue":"6","key":"9106_CR16","first-page":"489","volume":"650","author":"K Reinhardt","year":"1992","unstructured":"Reinhardt K. Sorting in place with a worst case complexity of n log n\u2009\u2212\u20091.3n\u2009+\u2009O(log n) comparisons and \u025bnlog n\u2009+\u2009O(1) transports. LNCS, 1992, 650(6): 489\u2013499.","journal-title":"LNCS"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9106-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9106-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9106-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:32:39Z","timestamp":1559399559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9106-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11]]},"references-count":16,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["9106"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9106-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11]]}}}