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
- 61180 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / sabir
(n+1)/2
| Is This Answer Correct ? | 13 Yes | 1 No |
Post New Answer View All Answers
What is ascii sort order?
Define non-terminal nodes in a tree?
What does abstract data type mean?
What is the need of sorting?
What is collections singletonmap?
What do you mean by separate chaining?
What are the properties of binary heap?
How can I learn data structures?
What does a treemap do?
What is homogeneous array?
Explain about the different lists available in the collection?
What are the different types of hash functions?
Give a real time example of stack
How can avl tree be useful in all the operations as compared to binary search tree?
What is difference between tree and binary tree?
