Performance Analysis of a Faster In−place External Sorting Algorithm
Asaduzzaman Nur Shuvo, Apurba Adhikary, Md. Bipul Hossain, Sultana Jahan Soheli
Asian Journal of Research in Computer Science · pp. 1–7 · Published 9 Jan 2020
10.9734/ajrcos/2019/v4i430122Abstract
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.
References (3)
Cited by 0
No indexed citations yet.
Related research
- Design and Development of an Improved Palm Kernel Shelling Machine and Separator — shares topic coverage
- Reliability and Efficiency of Computerized Systems for Admission into Colleges of Education Affiliated with the University of Cape Coast — shares topic coverage
- Automatic Sorting and Grading of Fruits Based on Maturity and Size Using Machine Vision and Artificial Intelligence — shares topic coverage
Article metrics
Real usage data collected on this platform.
36
Page views
0
PDF downloads
4
Outbound clicks
0
Citations
Views over time
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
Traffic sources
Referring site, by host.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.