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
35595 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

How do stacks work?

934

What is stack and queue in data structure?

943

What is difference between while and do while?

888

Is file a data structure?

975

What is application of data structure?

906

How much time does it take to learn data structures?

937

What are the drawbacks of array implementation of queue?

1148

Define a set?

951

Is hashmap sorted?

955

Does list allow null values?

929

What does arraylist remove do?

1012

What is the difference between arraylist and hashmap?

1033

How to find middle element of linked list in one pass?

939

What are the differences between b tree and b+ tree?

927

Can nsarray contain nil?

835