A Comparative Study of Sorting Algorithm Based on Their Time Complexity

The quest to develop the most memory efficient and the fastest sorting algorithm has become one of the crucial mathematical challenges of the last half century, resulting in many tried and tested algorithm available to the individual, who needs to sort the list of data. Today, the amount of data is very large, we require some sorting techniques that can arrange these data as fast as possible and also provide the best efficiency in terms of time and space. In this paper, we will discuss some of the sorting algorithms and compare their time complexities for the set of data.