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
- 66887 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / shyam
see
http://www.cs.odu.edu/~cmo/classes/msim602/studyGuide/ch10.doc.
for details..
the fact that the array is already sorted does not affect
the number of comparisons ..
| Is This Answer Correct ? | 6 Yes | 2 No |
Post New Answer View All Answers
What is difference between hashmap and treemap?
What is the difference between array and list?
Explain different methods in which you can traverse a tree?
Suppose in an integer array, there is 1 to 100 number, out of one is duplicate, how to find?
How to pass in data structure exam?
Define level of the tree?
What are types of Collision Resolution Techniques and the methods used in each of the types?
Can constructor be static?
What is data and information explain with example?
What are lists?
Which interfaces are implemented by hashmap?
Which is faster treemap or hashmap?
You want to insert a new item in a binary search tree. How would you do it?
What is stack in data structure with the example?
Is arraylist faster than array?
