(n+1)/2 here n= 100 so (100+1)/2 then 50.5 answer

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 / amit

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

Answer Posted / amit

(n+1)/2
here n= 100
so (100+1)/2
then 50.5 answer

Is This Answer Correct ?

2 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Does hashmap maintain insertion order?

885

What are two types of sorting?

978

What is the difference between Array and Array List ? Explain in brief with example.

933

What is a graph?

1916

What are common data structures?

984

Define linked list data structure.

952

write a code for Implementation of stack and queues.

948

What are the advantages of linked list?

786

Define terminal nodes in a tree?

1003

What is data structures in computer science?

892

Explain the principle of quicksort. What is its complexity?

1020

How will you sort the elements of array in descending order?

915

Define an equivalence relation?

1055

What is ordered map?

815

What is the function of stack?

811