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
- 66886 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / saurav
i dont think the above answer is correct..it should be (N+1)/2
according to me..if my answer is not correct,can anyone
explain me the reason..
| Is This Answer Correct ? | 54 Yes | 4 No |
Post New Answer View All Answers
What are different methods of collision resolution in hashing.
Why do we need linked list?
Define b-tree of order m?
Which is faster hashmap or concurrenthashmap?
How does a treemap work?
What is meant by heap sort?
Can a tree be empty?
Explain about set and their types in a collection?
What do you mean by linear probing?
How do you sort a collection in descending order?
Is array immutable?
What is a b+ tree? Explain its uses.
Where is insertion sort used?
Does treemap allow null values?
What is a postfix expression?
