Last Updated: 1/7/10 10:14 AM CSE 2011 Prof. J. Elder - 11 - Time Complexity of an Algorithm ±O(n2): For any input size n ±n0, the algorithm takes no more than cn2time on every input. ±²(n2): For any input size n ±n0, the algorithm takes at least cn2time on at least one input. ±³(n2): Do both. The time complexity of an algorithm is the largest time required on any input of size n. (Worst case analysis.)
has intentionally blurred sections.
Sign up to view the full version.