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?
Answer Posted / sabir
(n+1)/2
| Is This Answer Correct ? | 13 Yes | 1 No |
Post New Answer View All Answers
What is the use of heap sort?
Explain the difference between hashset and hashmap?
Can we store a string and integer together in an array?
What are the 3 types of measurement?
Differentiate file structure from storage structure?
What is the two-dimensional array?
What is the space complexity of selection sort?
Is array size dynamic or fixed?
Which process places data at the back of the queue?
What is meant by binary tree traversal?
How hashmap increases its size?
What is data structure explain in detail?
What is difference between array and string?
What is binary tree and its types?
How much time does it take to learn data structures?