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
How memory is reserved using a declaration statement in data structure?
Why do we need a data structure?
List out a few of the applications that make use of Multilinked Structures?
Why hashmap is faster than hashtable?
Why would you use a linked list?
Define quadratic probing?
What is sorting problem?
What is pointer in data structure?
What is int data type?
What is the minimum number of nodes in an avl tree of height h?
Does list allow null values?
What is the types of data structure?
What are stacks? Give some of its applications.
Explain what are the major data structures used in the rdbms?
For which header list, the last node contains the null pointer?