Explain binary searching, Fibinocci search.
- 5 Answers
- 22133 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
How can we reverse the order in the treemap?
What are the advantages of sorting and filtering data?
What are the basic data structures?
What exactly is data?
Is it possible to insert different type of elements in a stack? How?
Can we search the data in a linked list?
How does the size of arraylist increases dynamically?
What is data structure in programming language?
Are linked lists considered linear or non-linear data structure?
What is meant by binary tree traversal?
How do you use the sort function?
What is a directed graph?
What is the similarity between a Structure, Union and enumeration?
How does dynamic memory allocation help in managing data?
Which type of sorting is best?
