→ Its big in significance .

Objectives

• Motivate the need for something like Big O Notation
• Describe what Big O Notation is
• Simply Big O Expressions
• Define “time complexity” and “space complexity”
• Evaluate the time complexity and space complexity of different algorithms using Big O Notation.
• Describe what a logarithm is

What’s the idea here?

Imagine we have multiple implementations of the same function

How can we determine which one is the best?

Write a function that accepts a string input and returns a reversed copy

There are more than 10 solutions how we got to know which is the prefect solution.

Instead of saying all this to our code we can say numeric

representation of the code .Thats Big 0 take cares of

Who Cares?

→ It’s important to have a precise vocabulary to talk about how our code performs .

→ Useful for discussing trade-oofs between different approaches