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
- 66754 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 bubble sort technique?
What is internal and external sorting?
How many null values are allowed in hashmap?
Does hashmap preserve insertion order?
What is the complexity of arraylist?
What does stack top do?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Define a path in a tree?
What is the height of binary tree?
How null key is handled in hashmap?
how to add an item to the beginning of the list?
Why do we use hashmap?
What do you mean by recursive definition?
How do you use the sort function?
Can value be null in treemap?
