Big O Notation

Big O notation is a mathematical notation used to describe the performance or complexity of an algorithm. It specifically describes the worst-case scenario and helps us compare the scalability of different algorithms. This lesson will cover common complexities like O(1) constant time, O(n) linear time, O(n²) quadratic time, and O(log n) logarithmic time.