Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 23607 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 stable sorting?
What is two-dimensional array?
Differentiate between singly and doubly linked lists?
What does the term sorting refer to?
What is the use of prototype?
What is unhashable type list?
Is int a data structure?
What is Another name of Dynamically allocating memory.
How hashmap increases its size?
Write program for Bubble Sort ?
Explain how to find 3rd element from end in a linked list in one pass?
What is structured data with example?
Mention some drawbacks of the linked list.
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
What do you mean by structure property in a heap?
