Analyzing sorting algorithms #
Created Wednesday 11 December 2019
There are 5 criteria for any analyzing any sorting algorithm:
- Number of swaps
- Number of comparisons
- Inplace or not(i.e use extra memory or not)
- Adaptive - When input is a sorted array, does time complexity decrease for the case.
- Stable - Order of the elements with equal value stays the same Or not.