Consider Fibonacci numbers. Knowing the following is enough to calculate F(5):

F(4)

F(4) and F(3)

all Fibonacci numbers before F(5)

F(6)

is the answer all fibonacci number?

Recursion typically involves:

breaking a large problem into smaller problems of the same type

heavy use of internal stack

function calling itself

all of the above

is answer all of the above??

O ( 2^n*n^2) =

a

2^n*n^2

b

n*n

c

2^n

d.

n^2

Why is the Bubble sort n^2 (considering that inner loop doesn't go all the way to n)?

a	because O (1+2+3+...n) = n^2

b	Bubble sort is not an n^2 sort

c	because we have to count both odd and even exchanges

d	bubble sort is n * i sort