Multiple Choice
The best way to measure the goodness of an algorithm is
A) to write a computer program that uses the algorithm and time its execution
B) to write a computer program that uses the algorithm and run it on the hardest and largest inputs
C) to look at its worst case and average case complexity functions
D) to look at the sum of its execution time and the space it uses
Correct Answer:

Verified
Correct Answer:
Verified
Q24: Consider the code<br>Static void doQuickSort(int array[ ],int
Q25: Assuming a method<br>Int findMax(int array[ ],int last)that
Q26: To compare String objects for the purpose
Q27: The method int getPosition(int array[],int X)is designed
Q28: On the average,performing a sequential search on
Q30: A search for an item X in
Q31: The addition of two integers<br>A) is always
Q32: Let F be an algorithm with complexity
Q33: An array of 4 elements is being
Q34: The Quicksort algorithm works by<br>A) repeatedly comparing