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
- 67469 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
When is a graph said to be weakly connected?
What type of variable is age?
What is collection process?
What is return map?
What happens when arraylist is full?
Why we use linked list?
Define linear data structures?
Define an algorithm. What are the properties of an algorithm?
What is doubly linked list?
What do you mean by sorting data?
Does arraylist have index?
What will happen if an array goes out of bounds?
What is raid (redundant array of inexpensive disks)? Explain its level?
Explain the term run-time stack?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
