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
- 66106 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / tej pratap
it should be (100+1)/2.
| Is This Answer Correct ? | 12 Yes | 3 No |
Post New Answer View All Answers
Define dynamic data structures?
Write the postfix form of the expression: (a + b) * (c - d)
What are the applications of linked list?
What is the difference between a Stack and a Queue.
What does enum do?
Which is faster array or list?
List the types of rotations available in splay tree?
Differentiate between the singly linked list and doubly linked list.
State the rules to be followed during infix to postfix conversions?
Which is better than array and linked list?
What is the logic to reverse the array?
What is the use of prototype?
How many sorting techniques are there?
What is the difference between linked list and array?
What is the complexity of sorting algorithm?
