Definition: Algorithm Efficiency
An algorithm is efficient if its time complexity is on the order of for some constant , i.e. there is a polynomial of degree such that .
1 min read
Definition: Algorithm Efficiency
An algorithm is efficient if its time complexity T(n) is on the order of O(nc) for some constant c, i.e. there is a polynomial p(n) of degree c such that T(n)≤p(n).