MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Discrete Mathematics
→
Inference
→
The complexity of Fibonacci series i?
1.
The complexity of Fibonacci series i?
A.
O(2<sup>n</sup>)
B.
O(log n)
C.
O(n<sup>2</sup>)
D.
O(n log n)
Answer» B. O(log n)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
THE_WORST_CASE_OCCUR_IN_QUICK_SORT_WHEN?$
The_worst_case_complexity_of_quick_sort_is$
The complexity of Fibonacci series i?
The worst case complexity for insertion sort is
The Worst case occur in linear search algorithm when
The complexity of merge sort algorithm is
The complexity of linear search algorithm is
Which of the following case does not exist in complexity theory?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies