Topic study hub
Sorting algorithms
Official AQA 7517 section 4.3.5.
0
Objectives
10
Flashcards
10
Questions
64 min
Study time
AqaA LevelComputer ScienceFundamentals of algorithms
Choose a revision tool
Start revising Sorting algorithms
Syllabus checklist
What you need to know
0 objective pages available
Bubble sort1 objectives
- Bubble sort: Know and be able to trace and analyse the time complexity of the bubble sort algorithm. This is included as an example of a particularly inefficient sorting algorithm, time-wise. Time complexity is O(n2).
Merge sort1 objectives
- Merge sort: Be able to trace and analyse the time complexity of the merge sort algorithm. The 'merge' sort is an example of 'Divide and Conquer' approach to problem solving. Time complexity is O(nlog n).
Key terms
Time complexityTraceMerge sortDivide and Conquer
Exam tips
- Link the trace to the complexity: When explaining O(n2), mention both the repeated passes and the comparisons made during those passes.
- Show both parts of the analysis: When analysing merge sort, mention its Divide and Conquer structure as well as O(n log n).
Common mistakes
- Giving only the final sorted list: Record each relevant intermediate list state in the order produced by the algorithm, then give the final state.
- Giving the wrong complexity: State that merge sort has time complexity O(n log n).
Practice preview
Continue by objective
Objectives are grouped by subtopic so students can jump straight to the exact skill they want to revise.
Related topics