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
- 61149 Views
- ABB, SDE, I also Faced
- E-Mail Answers
Answer Posted / sabir
(n+1)/2
| Is This Answer Correct ? | 13 Yes | 1 No |
Post New Answer View All Answers
What is the logic to reverse the array?
List the data structures which are used in network data modal.
Are duplicates allowed in hashmap?
Difference between arrays and linked list?
Why does hashset use hashmap?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
Define in brief an array. What are the types of array operations?
What do you understand by doubly linked list?
How can we delete any specific node from the linked list?
Explain the term binding time?
Which is faster hashmap or hashtable?
How do you clear a stack?
What is b tree in data structure?
How is a hashset implemented?
Is file a data structure?
