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
- 66064 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
How can someone display singly linked list from first to last?
How do you declare A pointer to array of three chars
What are three common types of traversals?
Which sorting algorithm has minimum number of swaps?
What are basic algorithms?
What sort of serious problems have you experienced, and how have you handled them?
Can we put null value in hashmap?
Can hashset contain null?
What is adt in data structure with example?
What is a data structure? What are the types of data structures? Briefly explain them
What is the best sorting technique?
How do I sort a hashmap key?
What is the order of b tree?
Is selection sort greedy?
What is a hash index?
