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
- 66100 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
Why do we use collections?
What are the parts of a linked list?
Which is faster treemap or hashmap?
Is it possible to insert different type of elements in a stack? How?
Write a recursive c function to calculate the height of a binary tree.
What is the complexity of sorting algorithm?
What is a multiset table?
What is a static structure?
How is a queue works?
Is json a data structure?
Write an algorithm that counts number of nodes in the circular linked list
What is a concurrenthashmap?
Which interfaces are implemented by abstractsequentiallist?
Program to remove duplicate elements in an array.
What are the advantages of merge sort?
