A study on the performance of the external sorting algorithms with no additional disk space

Abstract

In this paper we have evaluated the performance of the existing external sorting algorithms with no additional disk space in terms ofI/O and time complexities. The complexities of the algorithms are deduced where it is necessary. For the purpose of the evaluation of the performance we have reviewed the algorithms briefly. A fter that the performance of the algorithms are compared and shown in tables and plotted graphs. From t he experimental results, we have shown that t he I/O complexities of the algorithms proposed by Dufrene and Lin and Md. Emdadul Haque et al. are the lowest. However, in term of the time complexity of the algorithm, the sorting algorithms proposed by M. R. Islam et at. is the lowest lowest.