A Novel Sorting Algorithm for Data Analysis

Authors

  • T. Kesava  Assistant Professor, Department of CSE, Shri Vishnu Engineering College for Women (A), Vishnupur, 2Bhimavaram, West Godavari District, Andhra Pradesh, India
  • G. Mohan Ram  Assistant Professor, Department of CSE, Shri Vishnu Engineering College for Women (A), Vishnupur, 2Bhimavaram, West Godavari District, Andhra Pradesh, India

Keywords:

Complexity, Sorting Algorithm

Abstract

Sort algorithms are a basic research domain in computer science. In last few years, many researchers proposed several sorting algorithm to enhance time complexity and space complexity. In this paper we present a mapping sorting algorithm for heterogonous values, which utilizes mapping techniques. The mapping technique will be between values of array and indexes without using any Correlation and interchanging values. The paper analyzes time complexity of proposed algorithm mathematically and empirically. The complexity of proposed algorithm is O(xlogm) + O(n) where n represents number of sorted elements and m, x<

References

  1. D.E. Kunth, The Art of Computer Programming: Vol. 3, Sorting and Looking, second printing, Addison-Wesley, Reading, MA, 1975.
  2. Karunanithi A., Drewes F., A Survey, Discussion and Comparison of Arranging Algorithms, Ume_a University, June 2014.
  3. Deepak ., Setia S .,Arya M ., Sorting calculation , International Journal Of Inventive Rseearch In Technology, 2015.
  4. Levitin A., Introduction To The Design And Analysis Of Algorithms, Villanova University,2012.
  5. Kocher1 G., Agrawal2 N, Analysis and Review of Sorting Algorithms, IJSER, March 2014.
  6. Puri T., Jain A., Sangwan A., Design and Analysis of Optimized Tallying Sort Algorithm, Department of Computer Science Swami Keshwanand Institute of Technology, Jaipur, INDIA
  7. Sedgewick R., Wayne K., Algorithms, fourth Edition, June 18, 2015.
  8. J.Alnihoud and R.Mansi, "An Enhancement of Major Sorting Calculations", The International Arab Journal of Information Innovation, Vol 7, No.1, January 2010.
  9. Owen Astrachan, Bubble Sort: An Archeological Algorithmic Analysis,SIGCSE 2003. Accessible: http://www.cs.duke.edu/~ola/papers/bubble.pdf
  10. Sedgewick, Algorithms in C++, pp.98-100, Addison-Wesley, 1992.
  11. P.J. Deitel and H.M.Deitel, C++ How to Program, Sixth Edition, pp.931-932, PHI Learning Ptd, 2008, ISBN-978-81-203-3496-0.
  12. Quick Sort HOARE, C. A.R. Quicksort. Comput. J. 5, I (1962), 10-15.
  13. Cormen T., Leiserson C., Rivest R., and Stein C., Introduction to Calculations, McGraw Hill, 2001
  14. http://algs4.cs.princeton.edu/addresses/23Quicksort.pdf ,2015

IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology

Downloads

Published

2018-02-28

Issue

Volume 3, Issue 1, January-February-2018

Section

Research Articles

License

Copyright (c) IJSRCSEIT

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
T. Kesava, G. Mohan Ram, " A Novel Sorting Algorithm for Data Analysis" International Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 1, pp.1454-1456, January-February-2018.