Size of the array:
Speed of the algorithm:
| Time Complexity: | ||
|---|---|---|
| Best | Average | Worst |
| Ω(n^2) | θ(n^2) | O(n^2) |
- iteration
- min index
- Sorted array
| Time Complexity: | ||
|---|---|---|
| Best | Average | Worst |
| Ω(n) | θ(n^2) | O(n^2) |
- j
- j+1
- Sorted array
| Time Complexity: | ||
|---|---|---|
| Best | Average | Worst |
| Ω(n) | θ(n^2) | O(n^2) |
- iteration
- Shifting elements
- Sorted array
| Time Complexity: | |
|---|---|
| Best : | Ω(nlog(n)) |
| Average : | θ(nlog(n)) |
| Worst : | O(n^2) |
- iteration
- pivot
- Sorted array
| Time Complexity: | |
|---|---|
| Best : | Ω(nlog(n)) |
| Average : | θ(nlog(n)) |
| Worst : | O(nlog(n)) |
- divided array
- mid
- Sorted array