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?
- 19 Answers
- 61189 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
what is Singly Linked list?
What is the difference between linked list and array?
What is difference between capacity and size of arraylist?
Define splay tree?
What is difference between hashmap and treemap?
Which file contains the definition of member functions?
Which sort is best for linked list?
What is the minimum number of queues that can be used to implement a priority queue?
What are the five examples of data?
Write an algorithm to show the reverse of link list?
Can we extend an array after initialization?
What is stable sorting?
Why do we use arrays?
Explain the term tail recursion?
Does hashmap allow duplicate keys?
