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
66852 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

What is the difference between sorting and classifying?

937

Can arraylist have null values?

862

Write a program to insert an element and in the specific position in the array?

913

Is binary tree a bst?

910

Is treemap thread safe?

888

What is bubble insertion selection sort?

868

Which is better than array and linked list?

945

When new data are to be inserted into a data structure?

924

Which data structures are used in bfs and dfs algorithm?

1043

How arraylist increase its size?

916

What is the use of bubble sort?

875

What is difference between hashmap and linkedhashmap?

915

Can we insert null in list?

893

How to find 3rd element from end in a linked list in one pass?

884

Is array a linked list?

904