Homework SourseCompare the bestcase time complexities of Exchange Sort and
Compare the best-case time complexities of Exchange Sort and Insertion Sort
Solution
When the list is already sorted (best-case), the complexity of exchange sort(bubble sort) and insertion sort are only O(n).
| Algorithm | Data Structure | best-case time complexities | |
| 1 | Exchange Sort or Bubble Sort | Array | O(n) |
| 2 | Insertion Sort | Array | O(n) |
