4.4.4.3 Order of complexity

To meet this assessment objective, you need to know:

• Be familiar with Big-O notation to express time complexity and be able to apply it to cases where the running time requirements of the algorithm grow in:

• constant time

• logarithmic time

• linear time

• polynomial time

• exponential time.