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
- 67448 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / sabir
(n+1)/2
| Is This Answer Correct ? | 13 Yes | 1 No |
Post New Answer View All Answers
Is tuple immutable?
What are the complexity of binary search?
How would you reverse the characters of an array?
Does treemap allow null keys?
Which sorting algorithm is used in arrays sort?
Which one is the simplest sorting in data structure?
Why does hashset use hashmap?
How do you clear a stack?
How to do the intersection of two sorted arrays?
Define forest?
What is meant by int?
Why is data structure important?
which is the simplest file structure? (Sequential, indexed, random)
How does a selection sort work?
Is array part of collection framework?
