(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
66105 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

What does arraylist remove return?

845

Is hashmap synchronized?

948

What is a spanning tree in data structure?

915

What is the difference between adt and data structure?

910

Which language is best for data structures?

907

What do u mean by array?

876

What is data and data structure?

905

What is the need for priority queue?

940

What is a sorting algorithm in data structure?

875

What is java priority queue?

918

Tell me how to find middle element of linked list in one pass?

862

Does treemap sort on key or value?

829

Is arraylist a list?

840

Is hashmap an object?

847

Is learning data structures necessary?

827