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's the difference between an array and vector?
Why do we use insertion sort?
How many types of data structure are there?
What is data structure and its classification?
Explain quick sort?
Write an algorithm to check if there is a loop in a doubly linked list.
How does quicksort partition work?
For searches. Which one is most preferred: array list or linked list?
Why linked lists are better than arrays?
Why do we use data structures?
Which sorting technique is faster?
Why is waste sorting important?
Which sorting is best for large data?
What is the maximum size of array?
Can binary tree have 1 child?