Page "Analysis of algorithms" Paragraph 2
from
Wikipedia
In theoretical analysis of algorithms it is common to estimate their complexity in the asymptotic sense, i. e., to estimate the complexity function for arbitrarily large input.
For instance, binary search is said to run in a number of steps proportional to the logarithm of the length of the list being searched, or in O ( log ( n )), colloquially " in logarithmic time ".
Usually asymptotic estimates are used because different implementations of the same algorithm may differ in efficiency.
However the efficiencies of any two " reasonable " implementations of a given algorithm are related by a constant multiplicative factor called a hidden constant.
Page 1 of 1.
2.128 seconds.