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
- 66751 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / punit
(n+1)/2
saurav is right.
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
Can we add or delete an element after assigning an array?
What are two types of sorting?
Briefly explain recursive algorithm 50 how do you search for a target key in a linked list?
Which list does not allow duplicates?
Are lists mutable?
How does variable declaration affect memory allocation?
What is an example of an array?
How to reference all the elements in a one-dimension array?
Define binary tree insertion.
What is the difference between collections class vs collections interface?
Does arraylist maintain insertion order?
Is quicksort faster than merge sort?
State the different ways of representing expressions?
Does mentioning the array name gives the base address in all the contexts?
How do you create a tree diagram?
