Earthquake data sorting with minimum swap operations

Abstract

Sorting is a very useful method required by many academic and scientific organizations. Sorting method presented in this paper places an item at final position by one swap operation only. This method is implemented in “C”. It is applied for sorting earthquake data set of size 10,000–300,000 with the increment of 50,000. For comparison purpose, number of swap operations and CPU time are considered with bubble, selection, and Insertion sort. Presented method takes lesser computation time than others.