Explain binary searching, Fibinocci search.
- 5 Answers
- 22139 Views
- CTS, IBM, TCS, I also Faced
- E-Mail Answers
Answer Posted / saroj kumar satapathy
In case of fibonacii search, themain difference is that we
neednot the division of no of element in an array. Because
the febonacii element is the addition of previous two
numbers.
| Is This Answer Correct ? | 1 Yes | 1 No |
Post New Answer View All Answers
Define left-in threaded tree?
What is the difference between collection and collections?
Can arraylist store objects?
Why merge sort is better than insertion sort?
Explain implementation of traversal of a binary tree.
Differentiate between queue and deque.
How expression trees are gets represented in data structure?
Does arraylist have a tostring?
What is mean by selection sort?
What are the difference between malloc() and calloc()?
Define balanced trees?
How many null values are allowed in hashmap?
How do you do a heap sort?
Why is concurrenthashmap thread safe?
What is basic data structure?
