# What Is Big O? (Comparing Algorithms)

With so many ways to solve a problem, how do we know which was is the right one? Let’s look at one of the most common methods for analyzing algorithms: Big O Notation.

Created by: Cory Chang

Produced by: Vivian Liu

Script Editor: Justin Chen, Brandon Chen, Elaine Chang, Zachary Greenberg

Twitter: https://twitter.com/UBehavior

—

Extra Resources:

Big O Wiki: https://en.wikipedia.org/wiki/Big_O_notation

Analysis of Algorithms: https://en.wikipedia.org/wiki/Analysis_of_algorithms

Time Complexity: https://en.wikipedia.org/wiki/Time_complexity

Sorting: https://en.wikipedia.org/wiki/Sorting_algorithm

Fast Inverse Square Root: https://en.wikipedia.org/wiki/Fast_inverse_square_root

Picture Credits:

https://s-media-cache-ak0.pinimg.com/originals/71/08/80/7108806b2c021ac3fba90f55983a4c5c.png