we have to check all the elements of the array.so average is n(size of arr

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 / mounesh badiger

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

Answer Posted / mounesh badiger

we have to check all the elements of the array.so average is
n(size of array)

Is This Answer Correct ?

14 Yes

3 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Define Data Structures?

1017

What is list and its types?

942

What is data structure explain different types of data structures with examples?

984

Can we apply binary search algorithm to a sorted linked list, why?

993

What is difference between arraylist and linkedlist?

1089

What is the difference between ienumerable and list?

917

What are binary trees?

1701

Is arraylist better than array?

1015

How do you find the space complexity of a bubble sort?

886

What is a matrix? Explain its uses with an example

1251

Explain Array

1033

What is the difference between classifying and sorting?

1098

What is the easiest sorting method to use in data structures?

1127

Does arraylist extend list?

995

How many pointers are necessary to implement a simple linked list?

1180