Register

Recursive fibonicci series Time complexity will be?

• retagged by
274 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
1
LavTheRawkstar asked Jan 11, 2017
1,343 views
Using Horner method and Brutef force method what will be the Time Complexity of
Using Horner method and Brute force what will be the Time Complexity of 4x4+7x3-2x2+3x+6
Using Horner method and Brute force what will be the Time Complexity of 4x4+7x3-2x2+3x+6
User Avatar
0 votes
0 votes
4 answers
2
Ankitrana asked Mar 23, 2016
770 views
what will be the time complexity for the below question ?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more than n/2 positions of an array. what is the time complexity to check whether the majority element exist or not?
Let an array A[1,....n] has n elements, and every element of an array is less than or equal to n. An element is said to be "majority element" if it is occurred in more th...
User Avatar
3 votes
3 votes
3 answers
4
radha gogia asked Oct 6, 2015
907 views
What will be the time complexity of below code?
main(){ while(n>2) n=n/log(n); }
main(){ while(n>2) n=n/log(n); }
User Avatar
Link Copied!