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
- 66306 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
What is the difference between hashmap and arraylist?
Why heap sort is not used?
Define circular list?
Does hashset guarantee order?
What is concurrentlinkeddeque?
Why is hashmap used?
Which interfaces are implemented by linkedlist?
What does bubble sort do?
What is an externalizable interface?
What is ds tree?
What does the dummy header in linked list contain?
Does hashmap allow duplicate keys?
How to find the duplicate in an array?
What is a string or array type?
In what data structures are pointers applied?
