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
- 66400 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
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
What is push and pop in stack?
What is an object array?
List out the advantages of using a linked list?
What are different methods of collision resolution in hashing.
What is b tree in data structure?
Does set allow null values?
What is the difference between b tree and binary search tree?
What do you mean by Runtime Error
What is the difference between null and void pointer in data structures?
Which collection allows null values?
How is hashmap o 1?
What is the Difference between treemap and hashmap?
Define internal nodes?
Define double linked list?
