- Bubble sort && Insertion sort
best = O(n), average = worst = O(n ^ 2)
- Quick sort
best = average = O(nlog(n)) worst= O(n^2)
- Merge sort
best = average = worst = O(nlog(n))
- Selection sort
best = average = worst = O(n ^ 2)
best = O(n), average = worst = O(n ^ 2)
best = average = O(nlog(n)) worst= O(n^2)
best = average = worst = O(nlog(n))
best = average = worst = O(n ^ 2)