c. In this example you should assume that the function binarySearch is O(log n) x i)...

  

Transcribed Image Text:

c. In this example you should assume that the function binarySearch is O(log n) x i) ii) numberFound 0 for i = 0..(n-1) for j = 0..(n-1) if binarySearch(A[i,j]) numberFound = numberFound + 1 Use the Big-O notation to express the time complexity of this algorithm If this algorithm takes 10 seconds to execute when n=2000, estimate how long it will take when n=8000. [6 Marks] c. In this example you should assume that the function binarySearch is O(log n) x i) ii) numberFound 0 for i = 0..(n-1) for j = 0..(n-1) if binarySearch(A[i,j]) numberFound = numberFound + 1 Use the Big-O notation to express the time complexity of this algorithm If this algorithm takes 10 seconds to execute when n=2000, estimate how long it will take when n=8000. [6 Marks]