Exhaustive Analysis and Time Complexity Evaluation of Sorting Algorithms

This paper compares the time complexity of various sorting algorithms for the logic, code and time complexity of each algorithm. The sorting algorithms that this paper discusses are Selection sort, Bubble sort, Insertion sort, Quick sort and Merge sort. The algorithms execution times are calculated using the C++ chrono library. Each algorithms have different formats and their own pros and cons. This paper presents a study of how these different algorithms work and compares them on the basis of their execution time in different input size to reach a conclusion.