Interested to Buy Any Domain ? << Click Here >> for more details...
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
- 66075 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
Does linkedhashset allow duplicates?
What is doubly linked list in data structure?
How to check array contains value or not?
What is a spanning tree in data structure?
What is ds tree?
How will you sort the elements of array in descending order?
List out the disadvantages of using a linked list?
How do I sort hashset?
Will hashmap allow null keys?
What is data structure and its types?
What is immutablelist?
Can we sort hashmap?
What is the method to find the complexity of an algorithm?
What is the non linear data structure?
What should be done in the base case for this recursive problem?
