Big O Notation

Big O describes how the time is taken, or memory is used, by a program scales with the amount of data it has to work on

Big O helps us to measure the scalability of our code

Big O is a way to indicate complexities (Space Complexity & Time Complexity)

• Exercises
• Cheat Sheet

Time Complexity

• Linear Time - O(n)
• Constant Time - O(1)
• Quadratic Time - O(n^2)

Space Complexity

• Linear Space - O(n)
• Constant Space - O(1)

Rules

• Worst Case
• Remove Constants
• Different Terms for Inputs
• Drop Non Dominants

Data Structures

A data structure is a specialized format for organizing, processing, retrieving and storing data.

A data structure is a way of organizing the data so that it can be used efficiently.

Arrays

• Exercises
• Operations
• Implementing an array from scratch