Question: Write the time complexity of the following program statement using big-O notation int foo(int n) if (n == 1 1 1 n == 2) return

Write the time complexity of the following program statement using big-O notation int foo(int n) if (n == 1 1 1 n == 2) return 1; else return foo(n - 1) + foo (n - 2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
