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
- 67476 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / amit
(n+1)/2
here n= 100
so (100+1)/2
then 50.5 answer
| Is This Answer Correct ? | 2 Yes | 0 No |
Post New Answer View All Answers
What is circular queue in data structure?
Is hashmap a collection?
What is a data structure node class?
Define an equivalence relation?
When is a binary search algorithm best applied?
What is a stable sorting algorithm?
What is a bubble sort and how do you perform it?
Explain what is linear search?
What are examples of data structures?
Describe the complexity of Binary search
Does arraylist extend list?
Which is the parent class of deque
Which sorting algorithm is used in collections sort?
Why do we use a multidimensional array in data structure?
What is a Breadth First Search? Give a few of its applications.
