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
- 66869 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 are different types of sorting techniques?
Define depth and height of a node?
Is priority queue sorted?
What is a bubble sort and how do you perform it?
Can we insert null in list?
What is time complexity of hashmap?
What is a minimum spanning tree?
What is the procedure to insert into a sorted array?
What are the advantages and disadvantages of copyonwritearraylist?
How do you find the second largest element in an array of integers?
how to display Singly Linked List from First to Last?
Why is hashmap faster?
What is heap and its types?
How will you free the memory that is allocated at run time?
How is bubble sort done?
