We use Big O notation to identify growth rates of algorithm efficiency by how they respond to changes in input size. The letter O is used because the rate of growth of a function is also called order of the function.
O(1) Constant Time
O(N) Linear Time
O(N^2) Quadratic Time
Bibliography:
This OER resource is released under Creative Commons Attribution-Non Commercial-ShareAlike 4.0 International License. It was made for the Spring 2020 semester by Professor Katherine Chuang on Data Structures at Brooklyn College, Department of Computer and Information Science.
