Merge Sort Quiz DAA TASK3

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

• O(n)

• O(n log n)

• O(n²)

• O(log n)

Merge Sort is an example of which type of algorithm?

• Greedy algorithm

• Divide and Conquer algorithm

• Dynamic Programming algorithm

• Backtracking algorithm

What is the space complexity of Merge Sort?

• O(1)

• O(n)

• O(log n)

• O(n²)

Which of the following is true about Merge Sort?

• It is an in-place sorting algorithm.

• It is stable and maintains the relative order of equal elements.

• It has a worst-case time complexity of O(n²).

• It does not require additional memory for sorting.

In Merge Sort, what is the purpose of the 'merge' step?

• To divide the array into two halves.

• To combine two sorted subarrays into one sorted array.

• To swap elements to sort the array.

• To select a pivot element for partitioning.

What is the base case for the Merge Sort recursion?

• When the array is empty.

• When the array has one element.

• When the array is already sorted.

• When the array has two elements.

Which of the following sorting algorithms is most similar to Merge Sort in terms of time complexity?

• Bubble Sort

• Quick Sort

• Insertion Sort

• Selection Sort

What is the main disadvantage of Merge Sort?

• It is not stable.

• It has a high time complexity.

• It requires additional memory for merging.

• It cannot handle large datasets.

In Merge Sort, how many subarrays are created during the 'divide' step?

• 1

• 2

• 3

• 4

Which of the following is NOT a step in Merge Sort?

• Divide the array into two halves.

• Merge the two sorted halves.

• Select a pivot element.

• Recursively sort the subarrays.