Effective Performance of External Sorting with No Additional Disk Space

The efficiency of the external sorting is analyzed in terms of time and I/O complexities. In this paper we have presented a more effective external sorting algorithm, where both the time and output complexities have been reduced significantly and made the sorting faster. Both the time and output complexities of the proposed algorithm are analyzed here and compared with the complexities of existing algorithms. The proposed algorithm is notable in sorting a huge file, which is many times larger than the available main memory.