End Section 342 Invitation Computer Science 7th Edition Talked Trade Using Sequential Sear Q26403106
At the end of Section 3.4.2 (of Invitation to Computer Science,7th edition), we talked about the trade-off between usingsequential search on an unsorted list as opposed to sorting thelist and then using binary search. If the list size is n = 100,000,about how many worst-case searches must be done before the secondalternative is better in terms of number of comparisons? (Hint: Letp represent the number of searches done and assume selection sortwould be used to sort the list before using binary search.)