Multiple Choice
Which of the following correctly states the quick sort algorithm?
A) if (the list size is greater than 1)
{
a. Partition the list into four sublists.
b. Quick sort sublist1.
c. Quick sort sublist2.
d. Quick sort sublist3.
e. Quick sort sublist4.
d. Combine the sorted lists.
}
B) a. Find the location of the smallest element.
b. Move the smallest element to the beginning of the
Unsorted list.
C) if (the list size is greater than 1)
{
a. Partition the list into two sublists, say lowerSublist and
UpperSublist.
b. Quick sort lowerSublist.
c. Quick sort upperSublist.
d. Combine the sorted lowerSublist and sorted upperSublist.
}
D) if the list is of a size greater than 1
{
a. Divide the list into two sublists.
b. Merge sort the first sublist.
c. Merge sort the second sublist.
d. Merge the first sublist and the second sublist.
}
Correct Answer:

Verified
Correct Answer:
Verified
Q1: For a list of length n, the
Q12: When moving array values for insertion sort,
Q16: The swap function of quick sort is
Q21: During the sorting phase of insertion sort,
Q25: In the bubble sort algorithm, the following
Q34: The behavior of quick sort is _
Q34: Consider the following list:int list[] = {4,
Q35: For a list of length n,insertion sort
Q38: Suppose that L is a sorted list
Q41: To construct a search algorithm of the