Question $16$

Which of the following statements is true about linear search and binary search?

Binary search is faster than linear search for small arrays.

Linear search is faster than binary search for small arrays.

Linear search has a time complexity of $O(logn),$ while binary search has a time complexity of $O(n).$

Binary search has a time complexity of $O(logn),$ while linear search has a time complexity of $O(n).$