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
- 61158 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
Differentiate stack from array?
What are the types of data structures?
How do you represent a linked list?
Does arraylist shrink?
Check if duplicates exist in an array of N which has range 1 to N.
Can arraylist store primitives?
Is data structures and algorithms important?
How do you determine if a binary tree is height balanced?
What is a minimum spanning tree?
Why do we need searching algorithms?
Explain binary search tree?
What is insertion sort technique?
How many parts are there in a declaration statement using data structures?
Find duplicates in infinite range. Which data structure to be used to give efficient solution?
Can treeset contain null?
