Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23841 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 bubble sort with example?
How to traverse data in a linked list in forward and backward direction, write the algorithm?
What do you mean by overflow and underflow?
Which sorting is best in time complexity?
Explain the Queue
Explain the steps to insert data into a singly linked list?
Define union-by-weight?
How do hash tables work?
Why is null not allowed in concurrenthashmap?
What do you mean by garbage collection?
How do you reference all the elements in a one-dimension array?
Does hashmap preserve insertion order?
What is placement new in data structures?
List the differences between comparable and comparator interface?
Differentiate among cycle, path, and circuit?
