2.2

Question 1

What are the three steps in a merge sort

Answer 1

Divide, Conquer, Merge

Question 2

What does the divide section of a merge sort do

Answer 2

Splits each item in the array into their individual subarrays

Question 3

What does the conquer section of a merge sort do

Answer 3

Each subarray is sorted individually by comparing each subarray with the next subarray

Question 4

What does the merge section of a merge sort do

Answer 4

The sorted subarrays are merged back together in sorted order, this is repeated until all subarrays have been merged

Question 5

How does a bubble sort work

Answer 5

Compare the current item with the next item in the array, swapping if necessary until a swap cant be made, if a swap cant be made the “current item” is the item that cant be swapped against, this process continues until the end of the array has been reached where it starts again from the beginning, this process continues until no swaps have been made where the process terminates and the list has been sorted.

Answer 6

Insertion sort stars at the second element in the input, and compares it to the element to its left. If the two elements are in the wrong order, the smaller element is placed in the
lowest position. The third element in the input is then selected. It is inserted into the correct position in the sorted portion of the input to its left. This continues until the last element is
inserted into the correct position, resulting in a fully sorted array.