binary search complexity
halve the ordered search range each time, and the number of iterations is logarithmic.
symbols, variables and units
n: the number of elements; T: the order of magnitude of the number of operations.
applicable conditions and boundaries
is ordered and supports efficient random access; Big O is not an exact running time.
formula source code
The following is a copyable LaTeX expression.
T(n)=O(\log_2 n)
Reference and Extended Learning
MIT OpenCourseWare · Introduction to Algorithms ↗is organized according to model definition and assumptions. Please check actual conditions and original literature before engineering, research and clinical use.
binary searchcomplexity
The