12 terms

searching

looking through a file to see if a particular piece of data is there

sorting

putting items of data into a precise order, for example alphabetical or numerical

compare

assess how items of data are similar or different to each other, to help decide which order they should go in

adjacent items

items of data that are next to each other

sequential

starts at the beginning and moves through the list one by one

bubble sort

an algorithm used to sort an unordered list by comparing adjacent items

insertion sort

an algorithm used to sort an unordered list by examining each item in turn and inserting it into its correct position

merge sort

an algorithm used to sort an unordered list by repeatedly dividing a list into two smaller lists until the size of each list becomes one

recursively

repeatedly

brute force

an algorithm that does not include any techniques to improve performance, but relies on sheer computing power to try all possibilities until the solution to a problem is found

linear search

a simple sequential search that starts at the beginning of the list and moves through the items, one by one, until it finds a matching value or reaches the end without finding one

binary search

an algorithm that searches an ordered list to find an item by looking at the middle (median) item and comparing it with the search value