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
- 61256 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / abhishek chakladar
though average number of comparison of sequential search is (N+1)/2 then in the question N=100 so that the answer will be (100+1)/2
=101/2
=50.5
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
What do you mean by 2-3-4 tree?
How do you sort a list in reverse order?
Why merge sort is better than insertion sort?
Explain binary searching, Fibonacci search.
What is binary tree and its types?
What are the properties of binary tree?
What is time complexity of bubble sort?
What is a matrix?
What is the best case complexity of bubble sort?
What is definition list?
What is hashing technique? Describe in brief.
What do you mean by linear probing?
What is advantage and disadvantage of linked list?
Explain what is linear search?
If you do not initialize an array what will happen?
