Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23604 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / bharath
finally a sensible answer.........
fibonacci search is based on fibonacci heaps.
it is advanced structure tugher to implement and even more
efficient than BSTs , latest kernels used it fr app handles...
| Is This Answer Correct ? | 2 Yes | 2 No |
Post New Answer View All Answers
What are the operations that can be performed on a stack?
What is push and pop in stack?
What are the types of map?
Does hashmap preserve insertion order?
How expression trees are gets represented in data structure?
How to sort an Array?
Why quicksort is called quick?
Can we create a null as a key for a map collection?
Are dictionaries mutable?
What do you mean by union-by-weight?
How can you insert a node in a random location of the linked list?
Is list a data structure?
What is the use of isEmpty() member methods?
What are the goals of data structure?
Can we put null key in hashmap?
