Big O Notation

Question 1

O(1)

Answer 1

Constant Time
Check first position / no matter the size, the run time will always be the same.

Question 2

O(log n)

Answer 2

Logarithmic Time / Binary Search
Each comparison halves the list.

Question 3

O(n)

Answer 3

Linear Time
For Loop / Run-time increases when items are added.

Question 4

O(n log n)

Answer 4

Quasilinear Time / Merge Sort

Question 5

O(n^2)

Answer 5

Quadratic Time / Bubble Sort
In each pass through the list n items will be examined with at most n passes.
Nested Loops

Question 6

O(2n)

Answer 6

Exponential Time
Growth doubles with each value added.

Question 7

O(n!)

Answer 7

Factorial Time
Grows in a factorial way based on the size of the input data.