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
- 61141 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / amit
(n+1)/2
here n= 100
so (100+1)/2
then 50.5 answer
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What is the difference between data type and data structure?
What is a Breadth First Search? Give a few of its applications.
Explain the types of linked lists.
Is quicksort faster than merge sort?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What do you mean by primary clustering?
What is Doubly link list?
What exactly is data?
What is structured data with example?
Which sort is stable?
What is the difference between data types and data structures?
What is the difference between null and void?
What is shell sort in data structure?
What will be the output of below code?
Why is quicksort so fast?
