What is the best case and worst case complexity of ordered linear search?
1) O(logn), O(nlogn)
2) O(n), O(1)
3) O(1), O(n)