Criteria for analysis
- Number of comparisons
- Number of swaps
- Adaptive behaviour – Checking if the data structure is already sorted or completely unsorted
- Stable – Maintaining order of duplicate values in sorted data structure
- Extra memory – Space Complexity
Sorting algorithms
Comparison based sorting(More time complexity, less space complexity)
- Bubble sort
- Insertion sort
- Selection sort
- Heap sort
- Merge sort
- Quick sort
- Tree sort
- Shell sort
Index based sorting (More space complexity, less time complexity)
- Count sort
- Bucket/Bin sort
- Radix sort
Other sorting algorithms
Count sort in C/C++
Merge sort in C/C++
Quick Sort in C/C++
Selection sort in C/C++
Insertion Sort in C/C++
Bubble Sort in C/C++
Criteria for sorting analysis
