Merge and Insertion Sort A Level Computer Science

Which of the following best describes the Merge Sort algorithm?

• A comparison-based sorting algorithm that divides the array into halves, sorts them, and then merges them.

• A non-comparison-based sorting algorithm that uses counting to sort elements.

• A sorting algorithm that repeatedly swaps adjacent elements if they are in the wrong order.

• A sorting algorithm that selects the smallest element from an unsorted list and swaps it with the first unsorted element.

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

Which of the following is a key characteristic of the Insertion Sort algorithm?

• It is a recursive algorithm.

• It is an in-place sorting algorithm.

• It requires additional space proportional to the input size.

• It is a non-comparison-based sorting algorithm.

What is the best-case time complexity of the Insertion Sort algorithm?

Which sorting algorithm is generally more efficient for small datasets?

• Merge Sort

• Insertion Sort

• Quick Sort

• Bubble Sort

What is the space complexity of the Merge Sort algorithm?

In the context of sorting algorithms, what does "in-place" mean?

• The algorithm requires additional space proportional to the input size.

• The algorithm sorts the data without requiring additional space.

• The algorithm uses recursion to sort the data.

• The algorithm sorts the data in a separate array.

Which of the following is true about the stability of Merge Sort?

• Merge Sort is not a stable sorting algorithm.

• Merge Sort is a stable sorting algorithm.

• Merge Sort's stability depends on the implementation.

• Merge Sort is stable only for integer data types.

What is the average-case time complexity of the Insertion Sort algorithm?

Which of the following sorting algorithms is not comparison-based?

• Merge Sort

• Insertion Sort

• Counting Sort

• Quick Sort