Detour : Big-O Notation

Running time of an algorithm

Computer scientists typically measure an algorithm’s efficiency in terms of its worstcase running time, which is the largest amount of time an algorithm can take for the most difficult input of a given size. The advantage to considering the worst-case running time is that we’re guaranteed that our algorithm will never behave worse than our worst-case estimate.