Explain binary searching, Fibinocci search.
Answer Posted / vinoth kumar.r
Hey guys its fibonacci search not fibonacci sequence.
Its is efficient when locality of reference is plays a
greater role.
Go here:
http://en.wikipedia.org/wiki/Fibonacci_search_technique
Is This Answer Correct ? | 10 Yes | 6 No |
Post New Answer View All Answers
Which interface provides the capability to store objects using a key-value pair?
What is difference between array and arraylist?
Does hashmap allow null keys?
What is the meaning of arraylist?
What is entryset in hashmap?
What do you mean by free pool?
What is the difference between Array and Arraylist?
What sort of serious problems have you experienced, and how have you handled them?
What are the advantages of modularity?
Is map a data structure?
What is heap and its types?
When is a binary search algorithm best applied?
What is arrays copyof?
Explain Array of pointers?
What are the tasks performed while traversing a binary tree?