Sorting Library is developed for COM367 Advanced Data Structures lecture. It contains Insertion Sort, Selection Sort, Bubble Sort, and Merge Sort.
Sorting Library sorts and tests performance of the algorithms on random generated, ordered generated, and reverse ordered generated integer type arrays that contains elements between 1 000 and 10 000.
Sorting Library measures the algorithms in time and total steps to sort the array.
- C++ was used to develop Sorting Library
- It contains a class named SortLib and a main .cpp file.
Experiments Results are here.