Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23815 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
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
What are the types of data structures?
Which is better stack or queue?
what are the applications that use Linked lists?
Does hashmap sort automatically?
Why do we use insertion sort?
Why is arraylist used?
What is a linear search?
What is space complexity of a program?
What are the properties of an algorithm?
Is bucket sort stable?
Is arraylist a list?
What is a stable sorting algorithm?
Write the recursive c function to count the number of nodes present in a binary tree.
What is the limit of arraylist?
Which is better merge or quick sort?
