expressed as log n. 1:00. So the run time of binary search in Big O notation is O (log n). 1:01. Even for very large values event, that is very large lists you have to search 1:06. through, the number of operations needed to search is very small. 1:10.