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


Please Help Members By Posting Answers For Below Questions

Which interface provides the capability to store objects using a key-value pair?

796


What is difference between array and arraylist?

685


Does hashmap allow null keys?

634


What is the meaning of arraylist?

659


What is entryset in hashmap?

633


What do you mean by free pool?

749


What is the difference between Array and Arraylist?

767


What sort of serious problems have you experienced, and how have you handled them?

767


What are the advantages of modularity?

684


Is map a data structure?

663


What is heap and its types?

676


When is a binary search algorithm best applied?

861


What is arrays copyof?

660


Explain Array of pointers?

741


What are the tasks performed while traversing a binary tree?

800