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
- 66730 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / tej pratap
it should be (100+1)/2.
| Is This Answer Correct ? | 12 Yes | 3 No |
Post New Answer View All Answers
What is array and string?
What is sorting and its types?
How many null values are allowed in a set?
What is circular queue in data structure?
What are the advantages of data structure?
What is data structure and data type?
What is data structure explain different types of data structures with examples?
What is unhashable type list?
Does linked list allow null values?
What do you mean by union-by-weight?
Which sorting method is slowest?
What do you mean by probing?
What is binary tree? Explain its uses.
How can you insert a node to the beginning of a singly linked list?
Is null allowed in list?
