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
- 61148 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
Which is the parent class of enumset class?
What is a matrix? Explain its uses with an example
What is array traversing?
How does max heap work?
Why heap sort is not used?
Is linkedlist thread safe?
What do you mean by 2-3 tree?
What do you mean by sorting?
How hashmap increases its size?
Which sorting algorithms are in place?
How does the bubble sort work?
Is radix sort stable?
Can you change size of array once created?
Which is better hashset or treeset?
What is the difference between collections class vs collections interface?
