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
35102 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 better array or linked list?

854

Why do we use different types of data structures?

843

What is breadth first tree?

950

What are the basic data structures?

918

What is the application of queue?

854

Can binary tree have 1 child?

826

Differentiate between an array and an arraylist.

1010

What exactly is data?

875

write a program to accept name & sort them?

857

Have you ever used HashTable and Directory?

932

Does hashmap allow duplicate keys?

949

Write a program for Sorting an Array. Which sorting will you prefer?

920

Can a tree be empty?

816

Which is best book for data structures?

885

Why using cookie to store session info is a better idea than just using session info in the request?

881