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
- 66760 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 happens if an array goes out-of-bounds?
Can we insert null in set?
What the principle of quick sort and its complexity?
Differentiate between file and structure storage structure.
Is bubble sort faster than selection sort?
Describe tree database.
How many types of sorting algorithms are there?
Who invented merge sort?
Does hashtable allow null values?
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
How does a dynamic array work?
What is an array vs list?
What is merge sort in daa?
What is the prerequisite for binary searching?
Does treemap sort automatically?
