Review on Sorting Algorithms – A Comparative Study
Muhammad Shahzad1, Muhammad Shakeel2, Um-A-Kalsoom3, Atiq Ur Rehman4, M Umair Shoukat5
1Muhammad Shahzad, School of Electrical and Electronics Engineering, North China Electric Power University, Changping District, Beijing, China.
2Muhammad Shakeel, Department of Electrical Engineering, The University of Lahore- Islamabad Campus, Islamabad, Pakistan.
3Um-e-Kalsoom, Department of Computer Science, Virtual University, Islamabad, Pakistan.
4Atiq Ur Rehman, School of Electrical and Electronics Engineering, North China Electric Power University, Changping District, Beijing, China
5M Umair Shoukat, Department of Electrical Engineering, Government College University Faisalabad Sahiwal Campus, Pakistan.
Manuscript received on November 05, 2017. | Revised Manuscript received on November 09, 2017. | Manuscript published on November 15, 2017. | PP: 17-20 | Volume-5, Issue-1, November 2017. | Retrieval Number: A1058085117
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Sorting of elements is an important task in computation that is used frequently in different processes. For accomplish task in reasonable amount of time efficient algorithm is needed. Different types of sorting algorithms have been devised for the purpose. Which is the best suited sorting algorithm can only be decided by comparing the available algorithms in different aspects. In this paper a comparison is made for different sorting algorithms used in computation.
Keywords: Best Sorting Algorithm, Bubble Sort Algorithms, Quick Sort Algorithms, Sorting Algorithms, Efficient Sorting.