Big O is a way to describe the rate of growth of an algorithm based on the input. Specifically, Big O is the upper bound runtime of and algorithm. It is defined as
where and
Created: Aug 19, 2021
Last Updated: Aug 19, 2021
Big O is a way to describe the rate of growth of an algorithm based on the input. Specifically, Big O is the upper bound runtime of and algorithm. It is defined as
where and