MCQ
Q.
Sequential search has a time complexity of O(n), and binary search has a time
complexity of O(log(n)). What difference will it make when the size n is 1000?
Correct Answer: D
log(1024) = 10, 1000/log(1000) is roughly equal to 1000/10 = 100