{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T16:26:26Z","timestamp":1649089586609},"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1982,5]]},"DOI":"10.1016\/0020-0190(82)90067-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"119-123","source":"Crossref","is-referenced-by-count":4,"title":["A hybrid of quicksort with O(n log n) worst case complexity"],"prefix":"10.1016","volume":"14","author":[{"given":"Johannes","family":"R\u00f6hrich","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(82)90067-9_BIB1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","article-title":"Algorithm 63. Partition. Algorithm 64. Quicksort","volume":"4","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(82)90067-9_BIB2","article-title":"The Art of Computer Programming","volume":"Vol. 3","author":"Knuth","year":"1972"},{"key":"10.1016\/0020-0190(82)90067-9_BIB3","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\/0020-0190(82)90067-9_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/362875.362901","article-title":"Algorithm 347. An efficient algorithm for sorting with minimal storage","volume":"12","author":"Singleton","year":"1969","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900679?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019082900679?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:54:01Z","timestamp":1555088041000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019082900679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0020019082900679"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(82)90067-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}