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
- 61316 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / prasad
n comparisons.
| Is This Answer Correct ? | 9 Yes | 25 No |
Post New Answer View All Answers
What is garbage collection in data structure?
What do you mean by probing?
How do you find the depth of a binary tree?
What is mean by selection sort?
Write a program for reversing the Single Linked List?
Which is better hashmap or hashtable?
How many types of linked lists are there?
What is immutablelist?
What are linked lists good for?
What is the difference between dictionary and hashtable?
What is entryset method in map?
Which is better merge or quick sort?
State the difference between stacks and linked lists?
Describe the complexity of Binary search
List the applications of set adt?
