【单选题】Linear 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 of n is 1000?( )
A.
You would not notice much difference because computers run very fast anyway.
B.
As n is 1000, Binary search is twice as fast as Linear search.
C.
As n is 1000, Binary search is 10 times as fast as Linear search.
D.
As n is 1000, Binary search is 100 times as fast as Linear search.