Algorithms sorting and searching revision

Question	Answer
What is Linear Search?	A way of searching through a list, which sorts through each individual item in a row.
What is Binary search?	A searching algorithm for lists.It splits the list in half and discards the half in which an item is not located. It repeats this until the item is found.
What is bubble sort?	A computing algorithm for sorting lists. It goes through the list linearly and compares adjacent items. It then swaps them if they are in the wrong order and moves on to the next adjacent pair. When it reaches the end of the list, it starts again. It stops when no items are swapped.
What is merge sort?	A computing algorithm for combining two sorted lists. If the lists are not sorted, items are split and two lists of one item are compared and sorted. This repeats for each individual list and the items are eventually sorted like this until 1 sorted list remains.

Resource summary

	Created by Daniel Minshull almost 8 years ago