Saturday, March 16, 2013
Asymptotic performance of algorithms
From wikipedia:
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm. It is a term commonly encountered in computer science research as a result of widespread use of big-O notation.
link: http://en.wikipedia.org/wiki/Asymptotically_optimal_algorithm
In computer science, an algorithm is said to be asymptotically optimal if, roughly speaking, for large inputs it performs at worst a constant factor (independent of the input size) worse than the best possible algorithm. It is a term commonly encountered in computer science research as a result of widespread use of big-O notation.
link: http://en.wikipedia.org/wiki/Asymptotically_optimal_algorithm
Subscribe to:
Posts (Atom)