A Comparative Study of Various Sorting Algorithms

Abstract

This paper is aimed at comparing the time complexity of six sorting algorithms: bubble sort, insertion sort, selection sort, counting sort, radix sort and bucket sort. Based on the logic implemented to sort the set of values, algorithms are categorized into comparison and noncomparison sorting algorithms. The choice of sorting algorithm to be implemented depends on the range and distribution of values to be sorted. The scenario in which each of the algorithms generates good performance and is preferred to be implemented is discussed and the control flow structure of each of the sorting algorithms is illustrated.

Keywords: Sorting, Bubble, Selection, Insertion, Counting, Radix, Bucket