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
- 66101 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / amit
(n+1)/2
here n= 100
so (100+1)/2
then 50.5 answer
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
Which is better merge sort or quick sort?
How do you determine if a binary tree is height balanced?
Explain Array
Can we extend an array after initialization?
List out a few of the applications that make use of Multilinked Structures?
What is queue in data structure?
Is boolean a data type?
What are the difference between malloc() and calloc()?
How do you empty an arraylist?
What are the advantage of collection classes over arrays?
What is the difference between array and stack?
What is difference between tree and binary tree?
What do you mean by double hashing?
Can value be null in treemap?
What are the advantages of stack?
