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?
Answer Posted / prasad
n comparisons.
| Is This Answer Correct ? | 9 Yes | 25 No |
Post New Answer View All Answers
How do I rearrange rows in numbers?
What is meant by binary tree traversal?
Why do we Use a Multidimensional Array?
What is a 2 dimensional array?
What is tree and its properties?
Define the tree data structure.
Which interface provides the capability to store objects using a key-value pair?
What is Doubly link list?
What can be stored in an arraylist?
Mention for which header list, you will found the last node contains the null pointer?
What is difference between hashmap and arraylist?
Why null is not allowed in treemap?
What are different types of sorting algorithms?
List the data structures which are used in rdbms, network data modal, and hierarchical data model.
How to traverse data in a linked list in forward and backward direction, write the algorithm?