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
- 66739 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / mohit0749
I think it we can apply binary search which requires only logn comparison becoz elements are ordered (largest to smallest).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What do you mean by disjoint set adt?
What is breadth first tree?
How does insertion sort works?
On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.
Is array a linked list?
Can you use Bubble Sort To sort the number of elements.
What is an ordered list?
Why use a tuple instead of a list?
What are the types of binary tree?
What is precision?
Difference between abstract data type, data type and data structure?
Why we need cursor implementation of linked lists?
What type of variable is age?
Will it create any problem if we add elements with key as user defined object into the treemap?
Define balanced trees?
