CS paper 2

Question 1

Key Features of Bubble sort

Answer 1

Uses an outer while loop (to test to see if no swaps where made in a pass)
Uses an inner for loop (repeated for the length of the code)
Uses a flag (boolean value) to track if a swap has been made
Uses a temporary value to help correctly swap elements

Question 2

Key features of merge sort

Answer 2

Calls itself within the subroutine (known as a recursive algorithm)
Splits the sublists continously left and right by 2 until each sublist has 1 value, then it’ll merge them

Question 3

Key features of binary search

Answer 3

Uses a while loop repeatedly (to compare the midpoint to the target value)