Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23874 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 type of data structure is used to perform recursion?
What does isempty() member method determines?
Which sorting algorithm is the slowest?
Is array a collection?
Explain the Linked List
How do you reference all the elements in a one-dimension array?
What sort of serious problems have you experienced, and how have you handled them?
Are data structures important?
What is raid (redundant array of inexpensive disks)? Explain its level?
Can hashmap be sorted?
Explain the common uses of threaded binary tree.
Why do we need algorithm?
What is the minimum number of queues that can be used to implement a priority queue?
Which interfaces are implemented by enumset?
Is treeset sorted?
