{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T06:10:08Z","timestamp":1746425408717,"version":"3.40.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319119328"},{"type":"electronic","value":"9783319119335"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-11933-5_78","type":"book-chapter","created":{"date-parts":[[2014,10,17]],"date-time":"2014-10-17T04:19:15Z","timestamp":1413519555000},"page":"693-700","source":"Crossref","is-referenced-by-count":4,"title":["Optimized Heap Sort Technique (OHS) to Enhance the Performance of the Heap Sort by Using Two-Swap Method"],"prefix":"10.1007","author":[{"given":"S.","family":"Sumathi","sequence":"first","affiliation":[]},{"given":"A. M.","family":"Prasad","sequence":"additional","affiliation":[]},{"given":"V.","family":"Suma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"78_CR1","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn., ch. 7. MIT Press, Cambridge (2001)"},{"key":"78_CR2","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E.. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison Wesley, Reading (1998)"},{"issue":"4","key":"78_CR3","doi-asserted-by":"publisher","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 ACM\u00a07(4), 701 (1964)","journal-title":"Communications of ACM"},{"key":"78_CR4","unstructured":"Cormen, et al.: Introduction to Algorithms, Chap. 6"},{"key":"78_CR5","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: Quicksort. Computer Journal\u00a05(1), 10\u201315","DOI":"10.1093\/comjnl\/5.1.10"},{"issue":"4","key":"78_CR6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.3734138","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: HEAPSORT. Communications of ACM\u00a07(4), 347\u2013348 (1964)","journal-title":"Communications of ACM"},{"issue":"1","key":"78_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(92)90005-Z","volume":"97","author":"I. Wegner","year":"1992","unstructured":"Wegner, I.: The Worst Case Complexity of McDiarmid and Reed\u2019s Variant of BOTTOM-UP HEAP SORT. Information and Computation\u00a097(1), 86\u201396 (1992)","journal-title":"Information and Computation"},{"key":"78_CR8","doi-asserted-by":"publisher","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\u00a024, 247\u2013250 (1987)","journal-title":"Information Processing Letters"},{"issue":"6","key":"78_CR9","doi-asserted-by":"publisher","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\u00a015(6), 964\u2013971 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"78_CR10","doi-asserted-by":"publisher","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\u00a010(3), 352\u2013365 (1989)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"78_CR11","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R.D. Dutton","year":"1993","unstructured":"Dutton, R.D.: Weak Heap Sort. BIT\u00a033(3), 372\u2013381 (1993)","journal-title":"BIT"},{"key":"78_CR12","first-page":"393","volume-title":"The Third Annual ACM SIAM Symposium on Discrete Algorithms","author":"S. Carlsson","year":"1992","unstructured":"Carlsson, S., Chen, J.: The Complexity of Heaps. In: The Third Annual ACM SIAM Symposium on Discrete Algorithms, pp. 393\u2013402. SIAM, Philadelphia (1992)"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the 3rd International Conference on Frontiers of Intelligent Computing: Theory and Applications (FICTA) 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11933-5_78","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T05:39:19Z","timestamp":1746423559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11933-5_78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319119328","9783319119335"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11933-5_78","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}