A Comparative Analysis of Sorting Algorithms on Integer and Character Arrays
Ahmed M. Aliyu, P. B. Zirra · 2013
-------------------------------------------------------------ABSTRACT--------------------------------------------------Most Practical applications in computer programming will require the output to be arranged in a sequential order. A lot of sorting algorithms has been developed to enhance the performance in terms of computational complexity, memory and other factors. This paper is an attempt to compare the performance of two sorting algorithm: Selection and Quick Sort, with the aim of comparing their speed when sorting an integer and string arrays. Analysis of these two sorting algorithm were also carried out. The finding shows that selection sort performs better than Quick sort. The study also indicates that integer array have faster CPU time than string