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
- 61150 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 linear-logarithm chasm?
Why is sorting important?
How many sorting are there in data structure?
What is data structure definition?
What is different between array and list?
Why hashtable is faster than arraylist?
What is hash data type?
What are three common types of traversals?
What are scalar values?
How to sequentially represent max-heap?
What is ds tree?
What do you mean by primary clustering?
What is sorting and its types?
How do you find the number of comparisons in bubble sort?
What is array and string?
