1. Engineering
  2. Computer Science
  3. implement a binary search function in 3 programming languages in...

Question: implement a binary search function in 3 programming languages in...

Question details

implement a binary search function in 3 programming languages. In each program (identical, except for the programming language), carry out the same 20,000,000 unsuccessful searches for eight different-sized arrays, namely arrays of sizes 128, 512, 2048, 8192, 32768, 131072, 524288, and 2,097,152. Measure in each of the three programs the time it takes to do the 20,000,000 searches for each of the eight arrays. Compare these timings to the theoretical timings the algorithm binary search provides. Are there differences between the three programs? Explain your timings and observations!!

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution