Edexcel GCSE Computer Science 2020
1.2.6: understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work
1.2.6: understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work
| Keyword | Definition |
|---|---|
| adjacent values | values which are next to each other |
| binary search | algorithm used to find a value in a sorted list which works by repeatedly dividing the list in two after checking the middle value |
| bubble sort | simple but slow sorting algorithm that works by swapping pairs of adjacent values in a list |
| linear search | algorithm used to find a value in any list which works by checking each value in order until it finds a match |
| merge sort | complex but fast sorting algorithm that works by splitting a list of values into individual values then recombining them in order |
| standard algorithm | step by step instructions to sort or search through data |
