Recursion Jeopardy Template

Recursion Mystery

Big O Basics

Big O Advanced

100

recursionMystery(0, 1)

0

100

Code Snippet A

O(n)

100

Code Snippet D

O(n)

200

recursionMystery(5, 2)

10, 5, 10

200

Code Snippet C

O(1)

200

Code Snippet A

O(N²)

300

recursionMystery(7,3)

21, 14, 7, 14, 21

300

Code Snippet B

O(n²)

300

Code Snippet B

O(Nlog(N))

400

recursionMystery(13, 4)

52, 39, 26, 13, 26, 39, 52

400

Code Snippet D

O(1)

400

Code Snippet C

O(Nlog(N))

500

x = sum( recursionMystery(3, 4) )

recursionMystery(x, 3)

x = sum(12, 9, 6, 3, 6, 9, 12) = 57

171, 114, 57, 114, 171

500

Code Snippet E

O(log(n))

500

Fibonacci Recursion

O(2^N)