Big O Notation

What is “Big O” Notation?

Big O notation: Indicates the worse-case run time for an algorithm–that is, how hard an algorithm may have to work to solve a problem.

Big O example:

Suppose an algorithm is designed to test whether the first element of an array is equal to the second. If the array has 10 elements, this algorithm requries one comparison. If the array has 15,000 elements, it still requires one comparison. In fact, the algorithm is completely independent of ...

Read more →