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
- 66829 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
What data structure underlies a python list?
What is collections singletonlist?
Is bubble sort faster than selection sort?
Define primary clustering?
What is the use of sorting?
What do u mean by data type?
How many types of data structure are there?
What do you know about traversal in linked lists?
What is the difference between data types and data structures?
In an avl tree, at explain what condition the balancing is to be done?
How to get the index of an array element?
How do I push an element into a stack?
Define graph traversals?
List some applications of queue data structure.
What is data structure and its operations?
