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
- 66388 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / tej pratap
it should be (100+1)/2.
| Is This Answer Correct ? | 12 Yes | 3 No |
Post New Answer View All Answers
Explain merge sort algorithms.
What is data structure and why we need it?
Name few collections map implementations?
Explain Stack
If you are using c language to implement the heterogeneous linked list, what pointer type should be used?
Explain the common uses of tree database.
Explain the Queue
How does linkedhashset work internally?
What is m way tree in data structure?
Tell us the difference between merge and quick sort. Which one would you prefer and why?
What are the types of algorithms?
What is array and its types in data structure?
What are basic algorithms?
How do you reference all the elements in a one-dimension array?
What is data structure and its operations?
