Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23813 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
Is data structures and algorithms important?
How many types of search algorithms are there?
Explain the applications of stack?
Explain the Stack
List the abstract operations in the set?
Define depth and height of a node?
What is basic data structure?
Which is faster hashmap or linkedhashmap?
Which sorting has less time complexity?
How do you use the sort function?
What is time complexity of binary search?
What do you mean by structure property in a heap?
Which sorting is worst?
Is radix sort faster than quicksort?
Tell me do array subscripts always start with zero?
