Sorting Algorithms: Merge and Quick

What is the primary purpose of the merge sort algorithm?

• To find the maximum element in an array

• To sort an array by dividing it into halves and merging them in sorted order

• To sort an array by selecting the smallest element and swapping it with the first element

• To sort an array by repeatedly swapping adjacent elements

Which of the following best describes the time complexity of the merge sort algorithm in the worst case?

In the quick sort algorithm, what is the role of the pivot element?

• To find the median of the array

• To divide the array into two parts, one with elements less than the pivot and one with elements greater than the pivot

• To swap with the first element of the array

• To merge two sorted halves of the array

What is the average time complexity of the quick sort algorithm?

Which of the following is a key difference between merge sort and quick sort?

• Merge sort is an in-place sorting algorithm, while quick sort is not

• Quick sort is an in-place sorting algorithm, while merge sort is not

• Both are in-place sorting algorithms

• Neither are in-place sorting algorithms

What is the best-case time complexity of the quick sort algorithm?

Which of the following sorting algorithms is considered stable?

• Quick sort

• Merge sort

• Bubble sort

• Selection sort

In the context of recursive sorting methods, what does the term "base case" refer to?

• The initial call to the recursive function

• The condition under which the recursion stops

• The final sorted array

• The first element of the array

Which of the following is a disadvantage of the merge sort algorithm?

• It is not stable

• It requires additional space for the temporary arrays

• It is not suitable for linked lists

What is the worst-case time complexity of the quick sort algorithm?