2. Sorting Algorithms
Home > Legacy A-Level Maths 2004 > AQA Decision 1 (D1) > 2. Sorting Algorithms
2.01a Introducing Bubble Sort
2.01a Introducing Bubble Sort
2.01b Bubble Sort: a second example
2.01b Bubble Sort: a second example
2.01c Bubble Sort: worst case scenario (complete reverse order)
2.01c Bubble Sort: worst case scenario (complete reverse order)
2.02a Introducing Shuttle Sort
2.02a Introducing Shuttle Sort
2.02b Shuttle Sort: a second example
2.02b Shuttle Sort: a second example
2.02c Shuttle Sort: worst case scenario (complete reverse order)
2.02c Shuttle Sort: worst case scenario (complete reverse order)
2.03a Shell Sort - an example with 8 numbers
2.03a Shell Sort - an example with 8 numbers
2.03b Shell Sort - an example with 10 numbers
2.03b Shell Sort - an example with 10 numbers
2.03c Shell Sort - an example with 7 numbers
2.03c Shell Sort - an example with 7 numbers
2.04a Quick Sort: introducing live and dead pivots
2.04a Quick Sort: introducing live and dead pivots
2.04b Quick Sort: a second example
2.04b Quick Sort: a second example