Best, Average & Worst Case

Array size (n) n = 20 Target position position = 1

Best: element at start → O(1)
Worst: element at end → O(n)
Average: somewhere in middle → O(n)