An External Sorting Algorithm Using In-Place Merging and With No Additional Disk Space

Authors

  • Md. Rafiqul Islam Computer Science and Engineering Discipline, Khulna University
  • S. M. Raquib Uddin Computer Science and Engineering Discipline, Khulna University

Keywords:

External sorting, Algorithms, In-place merging

Abstract

This paper presents an external sorting algorithm using linear-time in-place merging and without any additional disk space. The algorithm uses quick sort to produce runs in the first phase. In the second phase it uses special verification technique and uses in-place merging technique to reduce the average time complexity and disk I/Os especially the output (write) operations. The I/O and time complexities are analysed and compared with another algorithm [5] which also uses no additional disk space.

Downloads

Download data is not yet available.

Downloads

Published

2005-06-01

How to Cite

Islam, M. R., & Raquib Uddin, S. M. (2005). An External Sorting Algorithm Using In-Place Merging and With No Additional Disk Space. Malaysian Journal of Computer Science, 18(1), 40–49. Retrieved from https://ijps.um.edu.my/index.php/MJCS/article/view/6230

Issue

Vol. 18 No. 1 (2005): Malaysian Journal of Computer Science

Section

Articles