Multiple Choice
A ____ sort algorithm computes the middle position of an array and recursively sorts its left and right subarrays, merges to two sorted subarrays into a single sorted array, then stops when the subarrays can no longer be subdivided.
A) stack
B) merge
C) quick
D) recursive
Correct Answer:
Verified
Correct Answer:
Verified
Q32: Given two methods that perform the same
Q33: Jarrod knows that if the length of
Q34: sum(n) =n+sum(n-1), where n>1 is an example
Q35: Given a recursive definition of some process,
Q36: The logarithmic big-O value is _.<br>A) O(1)<br>B)
Q38: Identify the letter of the choice that
Q39: The constant big-O value is _.<br>A) O(1)<br>B)
Q40: A(n) _ algorithm is one that refers
Q41: In a quicksort algorithm, the middle of
Q42: sum(n) =1+2+3+...+n, where n>1 is an example