Please use this identifier to cite or link to this item:
|Title||A comparative Study of Sorting Algorithms Comb, Cocktail and Counting Sorting|
The sorting algorithms problem is probably one of the most famous problems that used in abroad variety of application. There are many techniques to solve the sorting problem. In this paper, we conduct a comparative study to evaluate the performance of three algorithms; comb, cocktail and count sorting algorithms in terms of execution time. Java programing is used to implement the algorithms using numeric data on the same platform conditions. Among the three algorithms, we found out that the cocktail algorithm has the shortest execution time; while counting sort comes in the second order. Furthermore, Comb comes in the last order in term of execution time. Future effort will investigate the memory space complexity.
|Published in||International Research Journal of Engineering and Technology (IRJET), e-ISSN 2395-0056|
|Series||Volume: 4, Number: 1|
|Item link||Item Link|
|Files in this item|
|Maghari, Ashraf Y. A._23.pdf||498.4Kb|