Section 1: Big O

Big O

• Big O

  -how big and speed code run

• Time complexity

  -how fast the code run

• Space complexity

  -how big the code run

Big O Worst Case

• Omega

  -best case scenario, for running a piece of code

  

• Theta

  -average case

  

• Omicron or Big-O

  -worst case

  

  -in interview they are telling you thats your worst case big O(omicron) whats your best case and average case

Big O: O(N)

def print_items(n):
    for i in range(n):
        print(i)
        
print_items(10)

-Example of O(n)

-we passed the number n and then in ran n times

-n was the number of operation

-horizontal axis(purple) is N or input size

-vertical axis(red) is number of operation

-Graph: straight line, proportional to n

-O of N is always straight line or proportional

• Proportional

  -that means O(n)