A .................... sort algorithm is usually faster to execute but more complex to write than bubble sort

• merge

• linear

• binary

Executing a merge sort takes up extra space in memory as new lists are made each time a list is split or two lists are combined

• False

• True

Merge sort works by ............. items in a list into individual ........ .before merging pairs of lists together in order until all the items are sorted

• splitting, lists

• joining, integers

In computer science, bubble sort is an efficient algorithm that implements a “divide and conquer” approach.

• False

• True

In computer science, merge sort is an efficient algorithm that implements a “divide and conquer” approach.

• True

• False

......... algorithms are used to arrange a sequence of items into a particular order (e.g. alphabetically) and is usually done to make searching faster.

• Searching

• Sorting

.................... involves moving through a list repeatedly, comparing items next to each other and swapping them if they are in the wrong order.

• Binary search

• Merge sort

• Bubble sort

....................... takes each item in turn, compare it to items in the sorted sublist and places it in the correct position.

• Bubble sort

• Insertion sort

• Binary search

........................ splits data until each item is in a list of its own and then combines pairs of lists repeatedly so that the items are in order.

• Linear search

• Bubble sort

• Merge sort

....................... is an algorithm that involves checking each item in a list one at a time to see if it’s the right item. If you have a list that is not in order, a ...................... is the only reasonable way to search through it.

• Binary search

• Linear search

• Merge sort

• Bubble sort