CPSC 2430 Data Structures

Fall Quarter 2021

Assignment 1

Task 6.

During our class, we formally defined Big O as:

T(n) is O(f(n)) if there exist a constant C (C > 0) and N (N 0) such that for

all n N, T(n) Cf(n).

Now try to use your own language to explain Big O as less formal as possible, as simple as possible (Suppose you need to explain this concept to Billie Eilish). You can use examples and graphs.