(n+1)/2 here n= 100 so (100+1)/2 then 50.5 answer

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?

Question Posted / amit

19 Answers
66753 Views
ABB, SDE, I also Faced
E-Mail Answers

Answer Posted / amit

(n+1)/2
here n= 100
so (100+1)/2
then 50.5 answer

Is This Answer Correct ?

2 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Can we add duplicate keys in a hashmap?

896

Which is more efficient merge sort vs quicksort?

850

What are types of Collision Resolution Techniques and the methods used in each of the types?

1076

Define Data Structures?

966

How do you clear a stack?

920

How will you free the memory that is allocated at run time?

964

How many types of data structure are there?

882

How to show internal storage representation of data structure in RDBM?

978

What are the types of map?

914

How many types of linked list exist?

964

How does variable declaration affect memory allocation?

1756

What do you mean by overflow and underflow?

933

Describe stack operation.

965

Is hashmap an array?

917

What is non linear data structure with example?

943