Explain binary searching, Fibinocci search.
- 5 Answers
- 22104 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / saroj kumar satapathy
In case of fibonacii search, themain difference is that we
neednot the division of no of element in an array. Because
the febonacii element is the addition of previous two
numbers.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
What is binary search tree and explain its time complexity?
What is the space complexity of bubble sort?
What's the difference between a hashtable and a hashmap?
What package is arraylist?
How will you check the validity of an expression containing nested parentheses?
Which is better than array and linked list?
What is a hash index?
What type of data structure is used to perform recursion?
What is circular queue in data structure?
what are the applications that use Linked lists?
What is heap with example?
Explain stacks and queues in detail.
Why is data structure important?
Explain what is the bucket size, when the overlapping and collision occur at same time?
Explain exception filter?
