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

Write an algorithm to show the reverse of link list?

804

Are data structures important?

882

Define depth and height of a tree?

1043

List the differences between comparable and comparator interface?

871

Does hashtable allow null values?

824

Can you sort a hashmap?

798

How to inverting a function in sort and searching?

893

Explain what is binary search?

906

Which is better bubble sort or selection sort?

778

Which interface provides the capability to store objects using a key-value pair?

1053

Is list an array?

787

What are the advantages of modularity?

897

What is example of data?

994

What are control structures?

892

Tell me about circular linked list?

887