Performance Analysis of a Faster In−place External Sorting Algorithm

Nur Shuvo, Asaduzzaman and Adhikary, Apurba and Hossain, Md. Bipul and Jahan Soheli, Sultana (2020) Performance Analysis of a Faster In−place External Sorting Algorithm. Asian Journal of Research in Computer Science, 4 (4). pp. 1-7. ISSN 2581-8260

[thumbnail of Adhikary442019AJRCOS53311.pdf] Text
Adhikary442019AJRCOS53311.pdf - Published Version

Download (425kB)


Data sets in large applications are often too gigantic to fit completely inside the computer’s internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottle−neck. While applying sorting on this huge data set, it is essential to do external sorting. This paper is concerned with a new in−place external sorting algorithm. Our proposed algorithm uses the concept of Quick−Sort and Divide−and−Conquer approaches resulting in a faster sorting algorithm avoiding any additional disk space. In addition, we showed that the average time complexity can be reduced compared to the existing external sorting approaches.

Item Type: Article
Subjects: Eprint Open STM Press > Computer Science
Depositing User: Unnamed user with email
Date Deposited: 13 Apr 2023 08:48
Last Modified: 02 Jan 2024 13:11

Actions (login required)

View Item
View Item