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
- 66079 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / ruchi baghel
it require n comparison where n=position of the element
if element is on 50th position
we just require 50 comparison bcz it is sequential search
one by one
| Is This Answer Correct ? | 1 Yes | 0 No |
Post New Answer View All Answers
How many sorting are there in data structure?
Is there any difference between int[] a and int a[]?
Differentiate between iterator and listiterator.
Is list same as array?
What are the tasks performed during inorder traversal?
What do you mean by tree edge?
What is the difference between null and void?
What are the difference between a stack and a queue?
What actions are performed when a function returns?
Which is faster list or set?
What is list and its types?
What are the different types of data structures explain briefly?
Tell me why can't constant values be used to define an array's initial size
Can you use Bubble Sort To sort the number of elements.
Are duplicates allowed in list?
