Edexcel GCSE Computer Science
1.1.8: understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work
1.1.8: understand how standard algorithms (bubble sort, merge sort, linear search, binary search) work
| Keyword | Definition |
|---|---|
| Binary search | a search algorithm that only works with data that has already been sorted. It works by repeatedly splitting the list in half until it finds what it's looking for or finishes without finding it. |
| Bubble sort | a slow but simple algorithm for sorting data that works by repeatedly swapping values that are next to each other until the whole list is in order |
| Linear search | a search algorithm that will find data in a list even if it's not sorted in order. It works by looking at each item in the list in order until it finds what it is looking for or finishes without finding it. |
| Merge sort | a sorting algorithm that works by repeatedly breaking up a list of data into smaller lists then merging those smaller lists back together in order |
| Search | check if and where a specific value can be found in within a set of data |
| Sort | arrange data in order from the smallest to largest values or vice versa |
