To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
A Comparative Study between Various Sorting Algorithms |
|
Author |
Jehad Hammad |
| Citation |
Vol. 15 No. 3 pp. 11-16 |
|
Abstract |
The objectives of this paper are to provide a solid foundation for the sorting algorithms and to discuss three of them (bubble sort, selection sort and gnome sort). In this work, the reader will be able to know the definition of algorithms and recognize the major design strategies of algorithms, including Divide and Conquer, Dynamic Programming, The Greedy-Method and Backtracking and Branch-and-Bound. The aim of this comparison between the three algorithms is to know the running time of each one according to the number of input elements. C-Sharp language is used in the implementation. The result of this implementation shows no specific algorithm can solve any problem in absolute. |
|
Keywords |
Bubble sort, selection sort, gnome sort, Divide-and-Conquer, Dynamic Programming, The Greedy-Method and Backtracking |
|
URL |
