yes.we need 100 comparisons.

The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?

Question Posted / vidhun s

11 Answers
35864 Views
Morgan Stanley, Wipro, I also Faced
E-Mail Answers

Answer Posted / vidhun s

yes.we need 100 comparisons.

Is This Answer Correct ?

13 Yes

4 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Which is the fastest sorting?

1034

Write a program for reversing the Single Linked List?

1132

How does bogo sort work?

1041

What is the idea behind splaying?

1836

What is sorting problem?

955

Is bubble sort slow?

947

What is sort function?

933

What is binary tree used for?

1007

What does abstract data type mean?

958

What happens if we put a key object in a hashmap which exists?

997

Define union-by-weight?

1091

What is the use of placement new?

1070

What is example of data?

1195

Can we extend an array after initialization?

1115

What are the types of map?

975