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
- 61262 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / sandep
all are correct
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
How does a selection sort work?
Is treeset synchronized?
Define linear probing?
What is data structure and data type?
Differentiate between hashmap and treemap.
Give one example of right rotation.
What are binary search and fibonacci search?
What is top in stack?
How many sorting are there in data structure?
What is difference between hashmap and hashtable?
Is hashset synchronized?
Differentiate between queue and stack.
What is a list of lists?
What is max heapify?
Which one is the simplest sorting in data structure?
