Review on Sorting Techniques
Abstract
There are many popular problems in different practical fields of computer sciences, database applications, Networks and Artificial intelligence. One of these basic operations and problems is sorting algorithm; the sorting problem has attracted a great deal of research. A lot of sorting algorithms have been developed to enhance the performance in terms of computational complexity. There are several factors that must be taken into consideration; time complexity, stability, memory space. Information growth rapidly in our world leads to increase developing sort algorithms.a stable sorting algorithms maintain the relative order of records with equal keys This paper makes a comparison between the Grouping Comparison Sort (GCS) and conventional algorithm such as Selection sort, Quick sort, Insertion sort , Merge sort and Bubble sort with respect execution time to show how this algorithm perform reduce execution time.
References
2. T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill, Third Edition, 2009,pp.15-17.
3. M. Goodrich and R. Tamassia, Data Structures and Algorithms in Java,John wiley & sons 4th edition, 2010,pp.241-243.
4. R. Sedgewick and K. Wayne, Algorithms,Pearson Education, 4th Edition, 2011,pp.248-249.
5. T. Cormen, C.Leiserson, R. Rivest and C.Stein,Introduction to Algorithms, McGraw Hill, 2001,pp.320-330.
6. H. Deitel and P. Deitel, C++ How to Program, Prentice Hall, 2001,pp.150-170
7. M. Sipser, Introduction to the Theory of Computation,Thomson,1996,pp.177-190.
8. S. Jadoon , S.Solehria, S.Rehman and H.Jan.( 2011,FEB). “ Design and Analysis of Optimized Selection Sort Algorithm”.11. (1), 16-21.
9. Available: http://www.ijens.org/IJECS%20Vol%20 11%20Issue%2001.html.
10. Aditya Dev Mishra & Deepak Garg.(2008,DEC). “Selection of Best Sorting Algorithm “, International journal of intelligent information Processing. II (II).pp. 363-368. Available: http://academia.edu/1976253/ Selection_of_Best_Sorting_Algorithm.
11. http://en.wikipedia.org/wiki/Insertion_sort
12. http://en.wikipedia.org/wiki/Merge_sort
13. http://en.wikipedia.org/wiki/Bubble_sort
14. http://www.techopedia.com/definition/3757/bubblesort
15. I. trini, k. kharabsheh, A. trini, (2013,may).”Grouping Comparison Sort”, Australian Journal of Basic and Applied Sciences.pp 221-228.
16. R. Sedgewick, Algorithms in C++, Addison–Wesley Longman,1998,pp 273–274.
17. A. Levitin, Introduction to the Design & Analysis of Algorithms, Addison–Wesley Longman, 2007, pp
98–100.
18. http://corewar.co.uk/assembly/insertion.htm
19. T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill, Third Edition, 2009,pp.15-21
20. Katajainen, Jyrki; Pasanen, Tomi; Teu Hola, Jukka (1996,MAR). “Practical in-place mergesort”. Nordic Journal of Computing. (3). pp. 27–40.
21. Kronrod, M. A. (1969). “Optimal ordering algorithm without operational field”. Soviet Mathematics - Doklady (10). pp. 744.
22. T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill, Third Edition, 2009,pp.145-164.
23. A. LaMarca and R. E. Ladner.(1997), “The Influence of Caches on the Performance of Sorting.” Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,. pp. 370–379.
24. D.Knuth, The Art of Computer Programming,Addison- Wesley,Third Edition 1997,pp. 106–
25. http://www.sorting-algorithms.com/bubble-sort.
26. T.Niemann, Sorting and Searching Algorithms:A Cookbook, 2008 , pp.11-14.
27. H.Ahmed,H.Mahmoud, N.Alghreimil,” A Stable Comparison-based Sorting Algorithm with worst Case complexity of O(n log n) Comparisons and O(n) Moves” ,World Academy of Science, Engineering and Technology(22),pp.970-975.
28. C.Cook , D.Kim. “Best sorting algorithm for nearly sorted lists”. Commun. ACM, 23(11),pp.620-624.
29. D.Garg,” Selection O. Best Sorting Algorithm”, International Journal of Intelligent Information
Processing 2(2),pp.363-368.
