though average number of comparison of sequential search is (N+1)/2 then in

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 / abhishek chakladar

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

Answer Posted / abhishek chakladar

though average number of comparison of sequential search is (N+1)/2 then in the question N=100 so that the answer will be (100+1)/2
=101/2
=50.5

Is This Answer Correct ?

1 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is difference between hashmap and map?

1175

How do you clear a stack?

988

Is arraylist reference type?

987

What is difference between data type and variable?

855

Explain the sorting algorithm that is most suitable to be used with single linked list?

891

What is array in data structure with example?

1007

What are the advantages of sorting and filtering data?

981

Explain Stack

1078

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

884

write an algorithm to show the procedure of insertion into a b-tree?

999

Why is arraylist not thread safe?

985

What do you mean by level of the tree?

1099

What do you understand by stable sort?

939

What is data structure and its operations?

893

Which is faster array or arraylist?

949