Two algorithms for searching arrays, called linear search and binary search, were discussed in the lectures. the linear search algorithm did only one comparison per iteration, but it needed many iterations. the binary search algorithm did more than one comparison per iteration, but it needed few iterations. as a result, linear search should be more efficient than binary search for small arrays, and binary search should be more efficient than linear search for large arrays. how big must an array be before binary search becomes more efficient than linear search? you will determine this experimentally.