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
- 66104 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
Define a Deque?
What is a queue in data structure?
What are the tasks performed during inorder traversal?
Is vector synchronized?
What is rule regarding overriding equals and hascode method?
What is a data structure node class?
What does map stand for?
What is an recursive algorithm?
Why do we use dynamic arrays?
Explain set interface?
What is bubble sort in data structure?
What is mean by selection sort?
What is difference between concurrenthashmap and hashtable?
What type of data structure is used to perform recursion?
What are the advantages and disadvantages of copyonwritearraylist?
