Slide on Big-O notation, conducted as a chapter event from Manipal Chapter of the Codecademy Community.

1. The
BIG O
notation
Mathematical Notations in Computer Science

2. A little bit of history

3. So what is it?
The Big O notation is used to analyze the efficiency of an algorithm, as the input
approaches infinity.

4. Why do we need it?
It tells us the worst-case scenario of a function, so we know what to
expect

5. First things first
What is space and time complexity?

6. Other types of
notation
Big O (O)
Big Omega (Ω)
Big Theta (θ)

7. O(1)

8. O(n)

9. O(n )
2

10. O(n )
3

11. O(2 )
n

12. O(logn)

13. O(nlogn)

14. O(n!)

15. How do these
notations rank?
Which notation is the best one?

16. The chart

17. The graph

18. Finding the
Big O
of an algorithm
Consider only the most significant notation

19. Lets wrap up
A list of important notes and clear action items is the
best way to summarize a productive team meeting.

20. That would be it