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
- 66752 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / dj
Answer is log n (base 2), Maximum camparision required to
search the array of 100 elments is 8. ( modified binary
search)
| Is This Answer Correct ? | 10 Yes | 7 No |
Post New Answer View All Answers
List out the advantages of using a linked list?
What is the difference between null and void?
Which is the parent class of abstractsequentiallist class?
How is a queue works?
How can I learn data structures?
how to add an item to the beginning of the list?
Which is better hashmap or arraylist?
Which type of memory allocation is referred for linked list?
What do you know about the big-o notation and can you give some examples with respect to different data structures?
What is a property class?
Why do we use dynamic arrays?
Explain what are the major data structures used in the rdbms?
Define primary clustering?
What are the operations that can be performed on a stack?
Define data type and what are the types of data type?
