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
- 66908 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
What's the difference between a hashtable and a hashmap?
Which language is best for learning data structures and algorithms?
Define rehashing?
How to create your own data structure in java?
How many links are there in a binary tree of N nodes?
What is the difference between Strings and Arrays?
What is a stable sorting algorithm?
Tell me about circular linked list?
Why is hashset not ordered?
What is the function of stack?
What is scalar data type?
What is the method to find the complexity of an algorithm?
Tell me the difference between structure and array?
What is impact of signed numbers on the memory?
Are collections thread safe?
