_____________________________________________________________________________________________________ *Corresponding author: E-mail: adhikary_apurba@yahoo.com; Asian Journal of Research in Computer Science 4(4): 1-7, 2019; Article no.AJRCOS.53311 ISSN: 2581-8260 Performance Analysis of a Faster In−place External Sorting Algorithm Asaduzzaman Nur Shuvo 1 , Apurba Adhikary 1,2* , Md. Bipul Hossain 1 and Sultana Jahan Soheli 1 1 Department of Information and Communication Engineering, Noakhali Science and Technology University, Noakhali − 3814, Bangladesh. 2 Electronics and Communication Engineering Discipline, Khulna University, Khulna − 9208, Bangladesh. Authors’ contributions This work was carried out in collaboration among all authors. Author ANS designed the study, performed the statistical analysis, wrote the protocol and wrote the first draft of the manuscript. Authors AA and MBH managed the analyses of the study. Author SJS managed the literature searches. All authors read and approved the final manuscript. Article Information DOI: 10.9734/AJRCOS/2019/v4i430122 Editor(s): (1) Dr. M. Ilayaraja, Assistant Professor, Department of Computer Science and Information Technology, Kalasalingam University, Krishnankoil, India. Reviewers: (1) Mohammad Shabaz, Chandigarh University, India. (2) Sapan Naik, Uka Tarsadia University, India. (3) Faki Ageebee Silas, Bingham University, Nigeria. Complete Peer review History: http://www.sdiarticle4.com/review-history/53311 Received 05 October 2019 Accepted 11 December 2019 Published 09 January 2020 ABSTRACT 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. Original Research Article