Big O notation is a concept borrowed from mathematics.
Big O is focusing on the steps required, not time.
Binary search O(log N) is faster than linear search O(N).
What is time complexity, or big O notation?
Is big O focusing on the runtime?
Which one is faster, O(N) or O(log N)?