A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://joems.springeropen.com/track/pdf/10.1186/s42787-019-0004-2">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer Science and Business Media LLC">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/pxhxgtdcdfhn7job2n4ojdfdou" style="color: black;">Journal of the Egyptian Mathematical Society</a>
Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics. A large number of sorting algorithms have been proposed based on different strategies. Recently, a sequential algorithm, called double hashing sort (DHS) algorithm, has been shown to exceed the quick sort algorithm in performance by 10-25%. In this paper, we study this technique from the standpoints of complexity<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s42787-019-0004-2">doi:10.1186/s42787-019-0004-2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3uocgzsharf3xgdypw7chgjpke">fatcat:3uocgzsharf3xgdypw7chgjpke</a> </span>
more »... ysis and the algorithm's practical performance. We propose a new complexity analysis for the DHS algorithm based on the relation between the size of the input and the domain of the input elements. Our results reveal that the previous complexity analysis was not accurate. We also show experimentally that the counting sort algorithm performs significantly better than the DHS algorithm. Our experimental studies are based on six benchmarks; the percentage of improvement was roughly 46% on the average for all cases studied.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200307090205/https://joems.springeropen.com/track/pdf/10.1186/s42787-019-0004-2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/7b/557bc37f3c3e749c95dbcfeb742f962c93ea743c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/s42787-019-0004-2"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>