Sorting By Element Position Count

Authors

  • Rayudu Srinivas  Haramaya University, Haramaya Institute of Technology, Harar, Dire Dawa, Ethiopia, India

Keywords:

Bubble Sort, Efficient Sort, Heap Sort, Novel Sort, Quick Sort, Sort, Tree Sort.

Abstract

The concept of sorting was introduced in 1880, but the study of research on sorting has started in the year 1950 which is cited as arranging data in a particular format. Rapid growth of information and data in our world leads to augment the development of sort algorithms. The facet which attracted a great deal of research, is developing sort algorithms through improved performance and decreased complexity. Sorting algorithm specifies the way to arrange data in ascending or descending order. Sorting is also used to represent data in more readable formats. Numerous sorting methods were developed but still there is a scope for sorting in research because no one method is suitable for all the applications. In this paper a novel method to sort given list of elements is presented. In this sorting, each element position count is calculated and based on this count value elements are arranged in order. The advantage of this method is easy count the position and swap operation are not required.

References

  1. Khalid Suleiman Al-Kharabsheh, Ibrahim Mahmoud AlTurani, Abdallah Mahmoud Ibrahim AlTurani & Nabeel Imhammed Zanoon, "Review on Sorting Algorithms A Comparative Study", International Journal of Computer Science and Security (IJCSS), Volume (7) : Issue(3) : 2013
  2. T. Cormen, C.Leiserson, R. Rivest and C.Stein, "Introduction To Algorithms", McGraw-Hill, Third Edition, 2009,pp. 15-17.
  3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. "Introduction to Algorithms", Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7
  4. M. Goodrich and R. Tamassia, "Data Structures and Algorithms in Java", John wiley & sons 4th edition, 2010, pp.241-243.
  5. Neubert, Karl-Dietrich. "The Flash sort Algorithm". Dr. Dobb's Journal: 123. Retrieved 2007-11-06
  6. Aditya Dev Mishra and Deepak Garg. "Selection of Best Sorting Algorithm ", International journal of intelligent information Processing. II (II).pp. 363-368,DEC, 2008.
  7. Hoare, C. A. R. "Algorithm 64: Quicksort". Comm. ACM. 4 (7): 321. doi:10.1145/366622.366644, 1961
  8. Donald Knuth. "The Art of Computer Programming, Volume 3: Sorting and Searching", Third Edition. Addison–Wesley, 1997. ISBN 0-201-89685-0. Pages 138–141 of Section 5.2.3
  9. Simon Singh "Flipping pancakes with mathematics". The Guardian. Retrieved March 25, 2014.
  10. Arulanandham, J. J.; Calude, C. S.; and Dinneen, M. J. "Bead-Sort: a Natural Sorting Algorithm." Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, No. 76, 153-162, 2002.
  11. Shell, D. L. (1959). "A High-Speed Sorting Procedure" (PDF). Communications of the ACM. 2 (7): 30– 32. doi:10.1145/368370.368387
  12. Phillips, Malcolm. "Array Sorting". Retrieved 3 August 2011.
  13. Brejova, B. "Analyzing variants of Shell sort". Inform. Process. Lett. 79 (5): 223–227. doi:10.1016/ S0020-0190(00) 00223-4 , Sep, 2001.
  14. Gonnet, Gaston. "Optimal Binary Search Trees". Scientific Computation. ETH Zürich. Retrieved 1 December 2013.
  15. Paul E. Black. "gnome sort". Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology. Retrieved 2011-08-20.
  16. Bender, M. A.; Farach-Colton, M.; Mosteiro M.. "Insertion Sort is O(n log n)". Theory of Computing Systems. 39 (3):391. doi:10.1007/s00224-005-1237-z,2006.
  17. Kutzner, Arne; Kim, Pok-Son, " Ratio Based Stable In-Place Merging Lecture Notes in Computer Science", Springer Berlin Heidelberg. pp. 246–257, 2008.
  18. Mallows, C. L. "Patience sorting". Bull. Inst. Math. Appl. 9: 216–224,1973
  19. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford, "8.2 Counting Sort", Introduction to Algorithms (2nd ed.), MIT Press and McGraw-Hill, pp. 168–170, ISBN 0-262-03293-7,2001.
  20. Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford "Introduction to Algorithms ", (3rd ed.). MIT Press and McGraw-Hill. pp. 655–657. ISBN 0-262-03384-4.
  21. Andersson, Arne, and Stefan Nilsson. "A new efficient radix sort." Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. IEEE, 1994.
  22. Kumar, Akash, Akshay Dutt, and Gautam Saini. "Merge Sort Algorithm." International Journal of Research 1.11 (2014): 16-21.
  23. Grabowski, Franciszek, and Dominik Strzalka. "Dynamic behavior of simple insertion sort algorithm." Fundamenta Informaticae 72.1-3 (2006): 155-165.
  24. Bowers, K. J. "Accelerating a particle-in-cell simulation using a hybrid counting sort." Journal of Computational Physics 173.2 (2001): 393-411.
  25. Astrachan, Owen. "Bubble sort: an archaeological algorithmic analysis." ACM SIGCSE Bulletin. Vol. 35. No. 1. ACM, 2003.
  26. Goodrich, Michael T. "Randomized shellsort: A simple oblivious sorting algorithm." Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2010.
  27. Sedgewick, Robert. "Implementing quicksort programs." Communications of the ACM 21.10 (1978): 847-857.
  28. Jadoon, Sultanullah, Salman Faiz Solehria, and Mubashir Qayum. "Optimized selection sort algorithm is faster than insertion sort algorithm: a comparative study." International Journal of Electrical & Computer Sciences IJECS-IJENS 11.02 (2011): 19-24.
  29. Yap, Chee K. "New upper bounds for selection." Communications of the ACM 19.9 (1976): 501-508.
  30. Ebell, Mark H., et al. "Strength of recommendation taxonomy (SORT): a patient-centered approach to grading evidence in the medical literature." The Journal of the American Board of Family Practice 17.1 (2004): 59-67.
  31. Sharma, Vandana, Satwinder Singh, and K. S. Kahlon. "Performance Study of Improved Heap Sort Algorithm and Other Sorting Algorithms on Different Platforms." IJCSNS 8.4 (2008): 101.
  32. Nassimi, David, and Sartaj Sahni. "Bitonic sort on a mesh-connected parallel computer." IEEE Transactions on Computers 1 (1979): 2-7.
  33. Zhang, Wang, et al. "Comparison research between xy and odd-even routing algorithm of a 2-dimension 3x3 mesh topology network-on-chip." Global Congress on Intelligent Systems. IEEE, 2009.
  34. Mackaness, William A. "An algorithm for conflict identification and feature displacement in automated map generalization." Cartography and Geographic Information Systems 21.4 (1994): 219-232.
  35. Pu, Yuliang, et al. "An efficient knn algorithm implemented on fpga based heterogeneous computing system using opencl." Field-Programmable Custom Computing Machines (FCCM), 2015 IEEE 23rd Annual International Symposium on. IEEE, 2015.
  36. Kelley, C. T. "Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition." SIAM journal on optimization 10.1 (1999): 43-55.
  37. Taherkhani, Ahmad, Ari Korhonen, and Lauri Malmi. "Automatic recognition of students' sorting algorithm implementations in a data structures and algorithms course." Proceedings of the 12th Koli Calling International Conference on Computing Education Research. ACM, 2012.
  38. Weiss, Mark Allen, and Susan Hartman. Data structures and problem solving using Java. Vol. 204. Boston, MA: Addison-Wesley, 1998.
  39. Meolic, R. . Demonstration of Sorting Algorithms on Mobile Platforms. In CSEDU ,2013, pp. 136-141.
  40. Srinivas, R., and A. Raga Deepthi. "Novel Sorting Algorithm", International Journal on Computer Science and Engineering (IJCSE), ISSN: 0975-3397, Vol. 5 No. , 01 Jan 2013
  41. Srinivas, R. "Enhanced Novel Sorting Algorithm." Global Journal of Computer Science and Technology, 2013.
  42. Srinivas, R., Shaik Vahid, and K. A. Sireesha. "Schematize Sorting." I J C T A, 9(6), 2016, pp. 3353-335.
  43. Srinivas, R., K. A. Sireesha and Shaik Vahid,. "Min-Max Sorting" , 2017.

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

Downloads

Published

2018-09-30

Issue

Volume 3, Issue 7, September-October-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]
Rayudu Srinivas, " Sorting By Element Position Count, IInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology(IJSRCSEIT), ISSN : 2456-3307, Volume 3, Issue 7, pp.157-164, September-October-2018.