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
- 66387 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
How do treesets work internally?
Write a program to insert an element and in the specific position in the array?
Can we define the size of arraylist?
What are the Difference between tcp and udp?
How will you explain circular linked list?
Is it possible to insert different type of elements in a stack? How?
Does arraylist contain duplicates?
Tell me what is quick sort?
How will you free the memory that is allocated at run time?
Is json a data structure?
Is arraylist fail fast?
Differentiate between arraylist and linkedlist.
Explain the internal working of a hash map?
How to get a list of tables, views and columns in firebird database?
What is 2 dimensional linked list?
