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

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

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

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

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

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

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

........................ 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.

....................... 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.

.......................... is a much more efficient way of searching through a list of items compared to a ....................... . However, you can only use a binary search algorithm if the data is ordered i.e. smallest to largest.

...................... the process of breaking problems down into smaller, more manageable parts.

........................... the process of removing unnecessary information and focussing on the important details.

............................ the process of developing an algorithm, which is a precise step-by-step solution to a problem that can be replicated by a human, computer, or both.

Emily, Aarav, and Ella are trying to find a specific book in a library. They decide to use a binary search algorithm to find the book. However, they realise they can only use this algorithm if the books are ordered from smallest to largest. Is this statement true?