Multiple Choice
Which of the following can be used to compare two algorithms?
A) growth rates of the two algorithms
B) implementations of the two algorithms
C) test data used to test programs which implement the two algorithms
D) computers on which programs which implement the two algorithms are run
Correct Answer:
Verified
Correct Answer:
Verified
Q17: What is determined by average-case analysis?
Q18: What is the drawback of the mergesort
Q19: Each merge step of the mergesort requires
Q20: The quicksort is _ in the worst
Q21: The selection sort is continued until _
Q23: How does the quicksort partition an array?
Q24: Algorithm efficiency is typically a concern for
Q25: In the worst case,the insertion sort's comparison
Q26: An exponential algorithm has the growth-rate function
Q27: When choosing between two algorithms,under what conditions