Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23873 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
What is a string array?
Which is better merge sort or quick sort?
List the types of rotations available in splay tree?
What is stack and its operations?
What are the types of binary tree?
What is difference between linear and non linear data structure?
How many sorting techniques are there?
Why merge sort is better than insertion sort?
What is weight balanced tree in data structure?
Differentiate file structure from storage structure?
What are data and data types?
Explain about set and their types in a collection?
How many links are there in a binary tree of N nodes?
Explain the Queue
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
