43. AQA GCSE (8525) SLR7 – 3.1 Merge sort

What sorting algorithm is described as more efficient than Bubble sort?

• Quick sort

• Selection sort

• Insertion sort

• Merge sort

Answer explanation

Merge sort is described as more efficient than Bubble sort due to its better time complexity, making it a preferred choice for sorting large datasets.

What method does Merge sort use?

• Divide and conquer

• Swapping

• Selection

• Partitioning

Answer explanation

Merge sort uses the Divide and Conquer method, where it divides the array into smaller subarrays, sorts them, and then merges them back together.

How does Merge sort handle large data sets?

• By selecting the smallest element and moving it to the start

• By moving the largest element to the end of the list

• By partitioning the data set around a pivot

• By splitting the data set in half repeatedly

Answer explanation

Merge sort handles large data sets by splitting the data set in half repeatedly, leading to efficient sorting.

What is the first step in the Merge sort algorithm?

• Selecting a pivot for partitioning

• Merging sorted lists

• Splitting the initial list into individual lists of one item

• Comparing items in adjacent lists

Answer explanation

The first step in the Merge sort algorithm is splitting the initial list into individual lists of one item, which is essential for the subsequent sorting and merging process.

What happens after the data set is split into individual lists in Merge sort?

• A pivot is selected for partitioning

• The largest item is moved to the end

• Adjacent items are merged back together

• The smallest item is moved to the start

Answer explanation

After the data set is split into individual lists in Merge sort, adjacent items are merged back together.

Which of the following is NOT a step in the Merge sort algorithm?

• Splitting the data set

• Merging sorted lists

• Comparing items in adjacent lists

• Selecting a pivot

Answer explanation

Selecting a pivot is NOT a step in the Merge sort algorithm. The correct steps include splitting the data set, merging sorted lists, and comparing items in adjacent lists.

What is the goal of the Merge sort algorithm in the provided example?

• To sort numbers in ascending order

• To arrange names based on length

• To put breakfast cereals in alphabetical order

• To categorize items by color

Answer explanation

The goal of the Merge sort algorithm in the provided example is to put breakfast cereals in alphabetical order.

What is the complexity of programming the Merge sort compared to Bubble sort?

• More complex

• Less complex

• Equally complex

• Not mentioned

Answer explanation

Merge sort is more complex than Bubble sort due to its divide and conquer approach, requiring additional steps for merging sorted subarrays.

In exams, what is required of students regarding Merge sort?

• To be able to follow the steps and illustrate the algorithm

• To compare Merge sort with other sorting algorithms

• To explain the history of Merge sort

• To write the complete code for Merge sort

Answer explanation

Students are required to be able to follow the steps and illustrate the Merge sort algorithm in exams.

What programming languages are mentioned for coding Merge sort?

• Java and C++

• JavaScript and Ruby

• Python and Visual Basic

• PHP and Swift

Answer explanation

Merge sort can be coded using Python and Visual Basic programming languages.