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

How memory is reserved using a declaration statement in data structure?

629


Why do we need a data structure?

488


List out a few of the applications that make use of Multilinked Structures?

728


Why hashmap is faster than hashtable?

513


Why would you use a linked list?

471






Define quadratic probing?

603


What is sorting problem?

486


What is pointer in data structure?

479


What is int data type?

545


What is the minimum number of nodes in an avl tree of height h?

463


Does list allow null values?

490


What is the types of data structure?

483


What are stacks? Give some of its applications.

555


Explain what are the major data structures used in the rdbms?

517


For which header list, the last node contains the null pointer?

487