Consider a sorted array: [2, 4, 6, 8, 10, 12, 14], and our objective is to locate the number 10. ... As a result, the time complexity of binary search can be written as: ...