Exit skills:
Define and explain the use of Big O notation
Analyse the efficiency of an algorithm
Define the term flag
Define the term list
Propose modifications to an algorithm to improve its efficiency
Big O notation
Big O notation is extremely useful when analysing algorithms, as it is a measure of the efficiency of an algorithm. We use it to say that an algorithm is O(n) what is meant is that the growth rate of the instructions in this particular algorithm shall be executed n times.
Classwork - Algorithmic worksheet 1 - Analysis and design of algorithms
Homework - Algorithms homework 1 - Analysis and design of algorithms