Skip to Main Content
It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.
| Brooklyn College Library & Academic IT |CISC Department

CISC 3130 Data Structures: Upper Bound (Big O) Notation

Professor Chuang Spring 2020 OER

Big O Notation

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: