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 / sandep
all are correct
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
What happens when arraylist is full?
What is ds heap sort?
What is a Queue? Explain its operation with example?
What is a directed graph?
What is meant by balanced binary tree?
Define an algorithm. What are the types of algorithms?
Design a datastructure to represent the movement of a knight on a chess board
Can you make an arraylist of arrays?
What do you mean by disjoint set adt?
What is internal and external sorting?
For addition and deletion. Which one is most preferred: array list or linked list?
How can you insert a node at the end of linked list?
When new data are to be inserted into a data structure?
What are the properties of binary tree?
Are collections thread safe?