i dont think the above answer is correct..it should be (N+1)/2 according

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

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

Answer Posted / saurav

i dont think the above answer is correct..it should be (N+1)/2
according to me..if my answer is not correct,can anyone
explain me the reason..

Is This Answer Correct ?

54 Yes

4 No

Post New Answer View All Answers

Please Help Members By Posting Answers For Below Questions

What is the height of an empty tree?

946

How do I start preparing for placement?

1048

Is there any difference between int[] a and int a[]?

1155

Does hashmap maintain insertion order?

911

Define parent node?

962

What are the different types of sorting? Explain the difference between them.

1026

What is queue example?

906

Is pointer a variable?

884

Define terminal nodes in a tree?

1027

Why quicksort is better than merge sort?

911

Can a hashmap have duplicate keys?

922

Is it possible to make an array volatile in java?

906

What sorting algorithm does arrays sort use?

818

Is boolean a data type?

950

What is garbage collection in data structure?

936