AQA GCSE Computer Science :
Algorithms
Algorithmcorrect answerA set of steps to complete a task / reach a goal
Decompositioncorrect answerBreaking down a problem into smaller (more solveable) parts
Pseudocodecorrect answerStructured English words which describe the steps in an algorithm.
Abstractioncorrect answerRemoving the complexity so that what remains is all that is needed to solve
the problem.
Algorithm Efficiencycorrect answerThe length of time it takes to run an algorithm
Bubble Sortcorrect answerA sorting algorithm.
Each item in a list is compared to the one next to it.
If first item is greater - swap places.
Compare next items - until end of list is reached.
Repeat the process until the array is sorted.
Merge Sortcorrect answerA sorting algorithm that splits an array into smaller and smaller sections. then
merges each section back together by comparing the smallest two items to be merged.
Insertion Sortcorrect answerA sorting algorithm that starts at item 1 of a list, removes it, and inserts it in
the correct place by using a second list of the same size. Once the end of the array is reached, item 0 is
inserted into the correct position.
Linear searchcorrect answerChecking each item in a list to see if it is what you are looking for. Suitable
for an unsorted list. For a list of n items, it takes an average of n/2 comparisons to find the item.
