Big Oh

Question 1

O(log(n))

Answer 1

narrows down the search by repeatedly halving the dataset until you find the target value.

Question 2

O(n)

Answer 2

performance becomes less efficient as data grows.

Question 3

Example of 2^n algorithm

Answer 3

recursive fibonacci: level 1 = 2^1, level 2 = 2^2, level 3 - 2^3 … etc

Question 4

Example of n! algorithm

Answer 4

recursive call of function with a for loop: when n = 3, level 1 = 3, level 2 = 2… or 3 * 2 * 1