Quick Sort Quiz

What is the time complexity of Quick Sort in the worst case?

• O(n log n)

• O(n^2)

• O(n)

• O(log n)

What is the purpose of the 'partition' function in the quicksort algorithm?

• To divide the list into two parts

• To merge two sorted lists

• To find the maximum element

• To reverse the list

What is the role of the 'temp' variable in the 'swap' function?

• To store the sum of two elements

• To temporarily hold a value for swapping

• To store the product of two elements

• To hold the pivot value

What happens if the 'partition' function is not correctly implemented in quicksort?

• The list will be sorted in reverse order

• The list will not be sorted correctly

• The list will be sorted twice

• The list will be unchanged

What is the base case condition for the recursive quicksort function?

• elements in the array are sorted

• elements in the sub-array are sorted

• two elements left in the sub-array

• only one element left in the sub-array

In the quicksort function, what is the purpose of the partition function?

• To merge two sorted arrays

• To find the middle element

• To rearrange elements around a pivot

• To swap the first and last elements

In order to sort the list in ascending order, what does the 'left' list comprehension do in the quicksort implementation?

• Collects elements greater than the pivot

• Collects elements equal to the pivot

• Collects elements less than the pivot

• Collects all elements

In order to sort the list in ascending order, what does the 'right' list comprehension do in the quicksort implementation?

• Collects elements greater than the pivot

• Collects elements equal to the pivot

• Collects elements less than the pivot

• Collects all elements

In the first quicksort implementation, what happens after the partition function is called?

• The array is printed

• The function returns immediately

• Quicksort is called recursively on two subarrays

• The pivot is swapped with the first element

What is the time complexity of Quick Sort in the average case?

• O(n²)

• O(log n)

• O(n log n)

• O(n)