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
- 61190 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / tej pratap
it should be (100+1)/2.
| Is This Answer Correct ? | 12 Yes | 3 No |
Post New Answer View All Answers
What is link list in data structure?
For searches. Which one is most preferred: array list or linked list?
What exactly is a thread?
Why is hashing used?
How does a dynamic array work?
Does hashmap preserve insertion order?
Different Types of pattern?
Differentiate between push and pop?
Explain the term run-time stack?
How do you implement a stack?
Treemap orders the elements on which field?
Is learning data structures necessary?
What is a directed graph?
Why is tuple immutable?
How do you find the number of comparisons in bubble sort?
