AQA A2 Computing 2.6 Searching and sorting

Question 1

Linear search

Answer 1

this search method starts at the beginning of the list and compares each element in turn with the required value until a match is found or the end of the list is reached

Question 2

Bubble sort

Answer 2

during a pass through the list, neighbouring values are compared and swapped if they are not in the correct order. Several passes are made until one pass does not require any further swaps

Question 3

Quick Sort

Answer 3

The list is split into two parts, one containing values less than a pivot value and the other containing values greater than the pivot value.