The table below shows all the sorting algorithms that will be analyzed and their expected best, average and worst case time complexities
| Name | Best | Average | Worst |
|---|---|---|---|
| Linear Search | O(1) | O(N) | O(N) |
| Binary Search | O(1) | O(log N) | O(log N) |
| Jump Search | O(1) | O(√n) | O(√n) |