Interested to Buy Any Domain ? << Click Here >> for more details...
What is the average number of comparisons needed in a
sequential search to determine the position of an element in
an array of 100 elements, if the elements are ordered from
largest to smallest?
- 19 Answers
- 66058 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / prasad
n comparisons.
| Is This Answer Correct ? | 9 Yes | 25 No |
Post New Answer View All Answers
Name few classes that implement collection interface?
Explain how is linked list implemented?
What is bubble sort and selection sort?
Does array sort mutate?
Can we use any class as map key?
Are linked lists considered linear or non-linear data structures?
What are the disadvantages of circular list?
Which is faster binary or linear search?
What is time complexity of bubble sort?
What is a priority queue?
What are different types of sorting techniques?
Is array static or dynamic?
What is difference between hashset and treeset?
When will you use array over arraylist?
Does linked list allow null values?
