Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 24037 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 is linear-logarithm chasm?
Is hashmap get thread safe?
Can we add elements to final list?
Is treeset thread safe?
What is a reverse linked list.
Write code for reversing a linked list.
Can value be null in treemap?
How to show internal storage representation of data structure in RDBM?
What do you mean by complexity of search algorithm?
Why quicksort is better than merge sort?
Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked)
What is the difference between for and foreach loop?
What is bubble sort algorithm in data structure sort and searching?
Why is hashmap faster?
What is a weighted graph?
