Interested to Buy Any Domain ? << Click Here >> for more details...
Explain binary searching, Fibinocci search.
- 5 Answers
- 24039 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 collections singletonlist?
How would you use bsearch() function to search a name stored in array of pointers to string?
Write an algorithm through which the inserting and deleting of elements can take place in circular queue?
Define primary data structures?
Explain Linked List
Which is the parent class of hashmap class?
Mention the steps to insert data at the starting of a singly linked list?
Is selection sort greedy?
an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
What is data type with example?
How do you implement a stack?
What are different types of sorting algorithms?
How does a hashmap work?
Is Arraylist faster than Array? Why?
What are the parts of a linked list?
