Explain binary searching, Fibinocci search.
- 5 Answers
- 22853 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
Is hashmap keyset ordered?
Explain what are the major data structures used in the network data model?
Why is an array homogeneous?
Name few collections map implementations?
Differentiate between list and set.
What is meant by binary tree traversal?
Write a code for dynamic allocation of array.
How do you initialize an arraylist?
What are priority queues?
What is a string or array type?
What is the use of isEmpty() member methods?
Is bucket sort a comparison sort?
What is array indexing?
How does selection sort work?
What is a binary search tree? Explain with example?
