Home / MCQ Bank / Computer
Computer Dynamic Programming In Data Structures Difficulty: Medium

What is the time complexity of the following for loop method used to compute the nth fibonacci term? int fibo(int n) if n == 0 return 0 else prevFib = 0 curFib = 1 for i : 1 to n-1 nextFib = prevFib + curFib prevFib = curFib curFib = nextFib return curFib

Select the correct option to test your answer:

More Computer Questions

What is the primary purpose of using a priority queue in graph algorithms like Dijkstra's? What will be the output of the following C code? #include<stdio.h> void f() { #define sf 100 printf("%d",sf); } int main() { #define sf 99; f(); printf("%d",sf); } What is unpickling? What is the role of the Hadoop Mapper.Context in a MapReduce application? What is the time complexity of Jump Search?