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
- 66078 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
How to reverse a linked list iterative algorithm?
Explain the internal working of a hash map?
Why do we need algorithm?
Explain binary searching and Fibinocci search?
Is hashset thread safe?
How many types of lists are there?
What is an example of an algorithm?
What is the use of prototype?
What is thread and types of thread?
Does arraylist extend list?
What is perfect binary tree?
Differentiate between list and map.
Explain what is B-tree?
Can nsarray contain nil?
What is the difference between Array and Array List ? Explain in brief with example.
