Question: what is big o complexity?
Answer: Big O Notation is a relative representation of an algorithm's complexity. ... It is the relative representation of the complexity of an algorithm. It describes how an algorithm performs and scales. It describes the upper bound of the growth rate of a function and could be thought of the worst case scenario.