(n+1)/2

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

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

Answer Posted / sabir

(n+1)/2

Is This Answer Correct ?

13 Yes

1 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Why do we Use a Multidimensional Array?

943

How do we find duplicate elements in an array?

1015

When will you use array over arraylist?

1004

Define dynamic data structures?

1061

What is Doubly link list?

1003

What is different between array and list?

964

We know that Arrays are objects so why cannot we write strArray.length()?

1657

How do you explain bubble sort?

926

How many types of arrays are there in visual basic?

992

What is binary search in programming?

944

Can we insert null in list?

951

Is list an array?

882

What is circular queue in data structure?

937

How to find the duplicate in an array?

1004

Which type of sorting is best?

974