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
- 61186 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / nilavalagan
The element may be found at any place in the array.
Supposing that the element is in 1st position, no.of comparison = 1;
Element is in 2nd position, no.of comparison = 2;
In the same way,
for the element present in 100th positionn no.of comparison = 100;
Total no.of comparison = 1+2+3+....+100
Average no.of comparison = (1+2+3+..+100)/100
= (100*101)/2*100
(Remember n(n+1)/2)
=101/2 = 50.5
In general = (n+1)/2; if there are n elements.
| Is This Answer Correct ? | 15 Yes | 0 No |
Post New Answer View All Answers
Differentiate bfs and dfs?
How would you reverse the characters of an array?
How do you find the index of an element in an arraylist?
How do I rearrange rows in numbers?
What is a bubble sort and how do you perform it?
Why sorting is done?
Which interface treemap implements?
Differentiate between hashset and hashmap.
What is a Stack? Explain with example?
Can treeset contain null?
What is difference between static and dynamic array?
Tell me the difference between structure and array?
What does stack top do?
How do you represent a linked list?
What is data and its type?
