Efficiency of search algorithms
Linear search: (sequential search) :
Best case : First element is the required element: O(1)
Worst case: Last element or element not present : O(N)
Average case: N/2 : After dropping the multiplicative constant (1/2) : O(N)