Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23674 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 linked lists good for?
How to reverse a linked list iterative algorithm?
Does treemap sort on key or value?
Is hashmap synchronized?
What is the advantage of the heap over a stack?
How to excel in data structures and algorithms?
In what data structures are pointers applied?
Which is better than array and linked list?
Define distributed query and linked server?
How do stacks work?
Explain circular linked list?
Which is the fastest sorting?
What is unhashable type list?
What are the benefits of using arrays?
Can we store a string and integer together in an array?
