{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T18:26:07Z","timestamp":1770575167274,"version":"3.49.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"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":11400,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1982,5]]},"DOI":"10.1016\/0167-6423(82)90016-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"223-233","source":"Crossref","is-referenced-by-count":51,"title":["Smoothsort, an alternative for sorting in situ"],"prefix":"10.1016","volume":"1","author":[{"given":"Edsger W.","family":"Dijkstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(82)90016-8_BIB1","series-title":"Program Construction","first-page":"54","volume":"69","year":"1979"},{"issue":"11","key":"10.1016\/0167-6423(82)90016-8_BIB2","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","article-title":"Best sorting algorithm for nearly sorted lists","volume":"23","author":"Cook","year":"1980","journal-title":"Comm. ACM"},{"issue":"12","key":"10.1016\/0167-6423(82)90016-8_BIB3","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 242 TREESORT 3","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0167-6423(82)90016-8_BIB4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232 HEAPSORT","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642382900168?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642382900168?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T01:01:43Z","timestamp":1621040503000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642382900168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0167642382900168"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(82)90016-8","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}