Home   >   CSC-OpenAccess Library   >    Manuscript Information
Review on Sorting Algorithms A Comparative Study
Khalid Suleiman Al-Kharabsheh, Ibrahim Mahmoud Al Turani, Abdallah Mahmoud Ibrahim AlTurani, Nabeel Imhammed Zanoon
Pages - 120 - 126     |    Revised - 15-08-2013     |    Published - 15-09-2013
Volume - 7   Issue - 3    |    Publication Date - September 2013  Table of Contents
Sort, Grouping Comparison Sort, Quick Sort, Merge Sort, Time Complexity.
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 has been developed to enhance the performance in terms of computational complexity. there are several factors that must be taken in 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.
CITED BY (3)  
1 Faujdar, N., & Ghrera, S. P. (2015, April). Analysis and Testing of Sorting Algorithms on a Standard Dataset. In Communication Systems and Network Technologies (CSNT), 2015 Fifth International Conference on (pp. 962-967). IEEE.
2 Hammad, J. (2015). A Comparative Study between Various Sorting Algorithms. IJCSNS, 15(3), 11.
3 KARIMIZADEH, M. M., RAFEAZADEH, E., AMIRI, P., & KHOLGHNIK, D. (2015). Enhancing and Optimization Sorting Algorithms: An Empirical Study. Cumhuriyet Science Journal, 36(6), 254-266.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 TechRepublic 
5 Scribd 
6 SlideShare 
7 PdfSR 
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.
A. Levitin, Introduction to the Design & Analysis of Algorithms, Addison–Wesley Longman,2007, pp 98–100.
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.
C.Cook , D.Kim. “Best sorting algorithm for nearly sorted lists". Commun. ACM,23(11),pp.620-624.
D.Garg,” Selection O. Best Sorting Algorithm”, International Journal of Intelligent Information Processing 2(2),pp.363-368.
D.Knuth, The Art of Computer Programming,Addison-Wesley,Third Edition 1997,pp. 106–110.
H. Deitel and P. Deitel, C++ How to Program, Prentice Hall, 2001,pp.150-170
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.
I. trini, k. kharabsheh, A. trini, (2013,may)."Grouping Comparison Sort", Australian Journal of Basic and Applied Sciences.pp221-228.
Katajainen, Jyrki; Pasanen, Tomi; Teuhola, Jukka (1996,MAR). "Practical in-place mergesort". Nordic Journal of Computing. (3). pp. 27–40.
Kronrod, M. A. (1969). "Optimal ordering algorithm without operational field". Soviet Mathematics - Doklady (10). pp. 744.
M. Goodrich and R. Tamassia, Data Structures and Algorithms in Java,John wiley & sons 4th edition, 2010,pp.241-243.
M. Sipser, Introduction to the Theory of Computation,Thomson,1996,pp.177-190.
P.Adhikari, Review on Sorting Algorithms, "A comparative study on two sorting algorithm",Mississppi state university, 2007.
R. Sedgewick and K. Wayne, Algorithms,Pearson Education, 4th Edition, 2011,pp.248-249.
R. Sedgewick, Algorithms in C++, Addison–Wesley Longman,1998,pp 273–274.
S. Jadoon , S.Solehria, S.Rehman and H.Jan.( 2011,FEB). " Design and Analysis of Optimized Selection Sort Algorithm".11. (1),pp. 16-21.Available: http://www.ijens.org/IJECS%20Vol%2011%20Issue%2001.html.
T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill, Third Edition, 2009,pp.15-21
T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill,Third Edition, 2009,pp.145-164.
T. Cormen, C.Leiserson, R. Rivest and C.Stein, Introduction To Algorithms, McGraw-Hill,Third Edition, 2009,pp.15-17.
T. Cormen, C.Leiserson, R. Rivest and C.Stein,Introduction to Algorithms, McGraw Hill,2001,pp.320-330.
T.Niemann, Sorting and Searching Algorithms:A Cookbook, 2008 , pp.11-14.
Mr. Khalid Suleiman Al-Kharabsheh
Albalqa applied university - Jordan
Mr. Ibrahim Mahmoud Al Turani
Al-balqa Applied University - Jordan
Mr. Abdallah Mahmoud Ibrahim AlTurani
Albalqa applied university - Jordan
Mr. Nabeel Imhammed Zanoon
Al-balqa Applied University - Jordan

View all special issues >>