I think it we can apply binary search which requires only logn comparison b

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

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

Answer Posted / mohit0749

I think it we can apply binary search which requires only logn comparison becoz elements are ordered (largest to smallest).

Is This Answer Correct ?

0 Yes

0 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

Does hashset guarantee order?

1010

Is red black tree balanced?

945

What is the difference between one and two dimensional?

1055

How do you sort a list in reverse order?

881

Explain binary tree traversals?

987

Why do we use a multidimensional array in data structure?

1069

Is binary tree balanced?

893

How do you replace an element in an arraylist?

1062

Explain what is B-tree?

1097

Differentiate between failfast and failsafe.

1227

What is data structures in computer science?

967

How do you find the second largest element in an array of integers?

1128

Is radix sort stable?

962

What is weight balanced tree in data structure?

941

Does hashset allow duplicates?

1136