Multiple Choice
Which of the following is true about a linear implementation of a table?
A) the unsorted implementations must insert a new item into its proper position as determined by the value of its search key
B) the sorted implementations can insert a new item into any convenient location
C) the sorted implementations maintain a count of the current number of items in the table
D) the unsorted implementations do not maintain a count of the current number of items in the table
Correct Answer:

Verified
Correct Answer:
Verified
Q37: The heapsort is _ in the average
Q38: What does the priority value in a
Q39: In the Java Collections Framework,what is the
Q40: What are the four categories of linear
Q41: In an unsorted array-based implementation of the
Q43: A semiheap is a _.<br>A)table<br>B)complete binary tree<br>C)general
Q44: In a linear implementation of the priority
Q45: The sorted array-based implementation of the tableInsert
Q46: For what kinds of situations is a
Q47: The mergesort is more efficient than the