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
- 66365 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
Is unordered_map a hash table?
What is the use of heap sort?
What can be stored in an arraylist?
Mention the data structures which are used in graph implementation.
Which interface treemap implements?
What is difference between hashtable and hashmap?
Write a program to reverse a single linked list.
Why sorting is used?
Which collection is fail safe?
How do you find the index of an element in an arraylist?
What is the use of isEmpty() member methods?
What is a static structure?
What is an object array?
What is data type in data structure?
What are different techniques for making hash function?
