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
- 61147 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
Explain the term tail recursion?
What is the use of bubble sort?
Does hashmap preserve insertion order?
What is the two-dimensional array?
What is a map in programming?
Why is hashmap faster than arraylist?
Is red black tree balanced?
Can a null element added to a treeset or hashset?
What are b tree keys?
What is the use of placement new?
Can a tree be empty?
What is unmodifiable list?
What is sort order?
What is shell sort in data structure?
What is linear-logarithm chasm?
