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
- 67465 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / punit
(n+1)/2
saurav is right.
| Is This Answer Correct ? | 28 Yes | 1 No |
Post New Answer View All Answers
Which sorting algorithm is the slowest?
Why do we study data structures?
Run time memory allocation is known as ?
What do you mean by union-by-weight?
What does map stand for?
Can sets contain duplicates?
What are threaded binary trees?
How to copy an array into another array?
What are the different types of linked list?
How efficient is binary search?
Run time memory allocation is known as in data structure?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).
State the difference between stacks and linked lists?
How do you find the height of a binary tree?
Are duplicates allowed in hashmap?
