{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:51:28Z","timestamp":1648669888370},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p> We revisit the method of Kirschenhofer, Prodinger and Tichy to calculate the moments of number of comparisons used by the randomized quick sort algorithm. We reemphasize that this approach helps in calculating these quantities with less computation. We also point out that as observed by Knuth this method also gives moments for total path length of a binary search tree built over a random set of [Formula: see text] keys. <\/jats:p>","DOI":"10.1142\/s179383091750001x","type":"journal-article","created":{"date-parts":[[2016,10,4]],"date-time":"2016-10-04T09:49:39Z","timestamp":1475574579000},"page":"1750001","source":"Crossref","is-referenced-by-count":1,"title":["Revisiting calculation of moments of number of comparisons used by the randomized quick sort algorithm"],"prefix":"10.1142","volume":"09","author":[{"given":"Sumit Kumar","family":"Jha","sequence":"first","affiliation":[{"name":"Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad 500 032, India"}]}],"member":"219","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"S179383091750001XBIB002","volume-title":"Mathematics for the Analysis of Algorithms: Modern Birkh\u00e4user Classics","author":"Greene D. H.","year":"2007","edition":"3"},{"issue":"42","key":"S179383091750001XBIB005","first-page":"269","volume":"22","author":"Kirschenhofer P.","year":"1987","journal-title":"Glas. Math."},{"key":"S179383091750001XBIB008","volume-title":"The Art of Computer Programming: Sorting and Searching","volume":"3","author":"Knuth D. E.","year":"1998","edition":"2"},{"key":"S179383091750001XBIB009","volume-title":"Algorithms","author":"Sedgewick R.","year":"2011","edition":"4"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S179383091750001X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:04:29Z","timestamp":1565096669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S179383091750001X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2]]},"references-count":4,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2017,2,6]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1142\/S179383091750001X"],"URL":"https:\/\/doi.org\/10.1142\/s179383091750001x","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2]]}}}