Earthquake Data Sorting with Minimum Swap Operations

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 336)

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.

Keywords

Sorting Insertion Bubble and selection sort Swap 

References

  1. 1.
    Alfred, V., Aho, J., Horroroft., Jeffrey, D.U.: Data structures and algorithms. Pearson Education Asia, India (2002)Google Scholar
  2. 2.
    Yang, Y., Yu, P., Gan, Y.: Experimental study on the five sort algorithms. In: IEEE 2nd International Conference on Mechanic Automation and Control Engineering (MACE), pp. 1314–1317, ISBN: 978-1-4244-9436-1, IEEE explore digital library (2011)Google Scholar
  3. 3.
    Beniwal, S., Grover, D.: Int. J. Emerg Res Manage. Technol. ISSN: 2278-9359, Vol. 2(5) (2013)Google Scholar
  4. 4.
    Kumari, A., Chakraborty, S.: Software complexity: A statistical case study through insertion sort. Appl. Math. Comput. 190(1), 40–50 (2007)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Jafarlou, M.Z., Fard, P.Y.: Heuristic and pattern based merge sort. In: Proceedings Computer Science, World conference on IT, vol. 3, pp. 322–324, Elsevier publication, Amsterdam (2011)Google Scholar
  6. 6.
    Iraj, H., Afsari, M.H.S., Hassanzadeh, S.: A new external sorting algorithm with selecting the record list location. USEAS Trans. Commun. 5(5), 909–913 (2006)Google Scholar
  7. 7.
    Lafore, R.: Data structures and algorithms in Java, 2nd edn. SAMS Publishing, Indianapolis (2002)Google Scholar
  8. 8.
    Robert, S.: Algorithms in C. Addison-Wesley Publishing Company, Inc., Reading (1998)Google Scholar
  9. 9.
    Knuth, E.: The art of computer programming sorting and searching. Addison Wesley, Reading (1998)Google Scholar
  10. 10.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT, Cambridge (2003)Google Scholar
  11. 11.
    Lipschutz, S.: Data structure with C. Tata McGraw-Hill Education, New Delhi (2009)Google Scholar
  12. 12.
    Brejova, B.: Analyzing variants of shell sort. Inf. Process. Lett. 79(5), 223–227 (2001)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.Wadia Institute of Himalayan GeologyDehradunIndia
  2. 2.Faculty of CS and ApplicationDIT UniversityDehradunIndia

Personalised recommendations