Study resource
Sorting algorithms common mistakes
Study Sorting algorithms with curriculum-aligned Common Mistakes resources, practice links, and exam-focused support.
At a glance
common mistakes
Resource type
Topic
Sorting algorithms
AqaA LevelComputer ScienceFundamentals of algorithms
Common mistakes
Giving only the final sorted list
A student writes the final result of a bubble sort trace but does not show the list after comparisons and swaps.
Fix itRecord each relevant intermediate list state in the order produced by the algorithm, then give the final state.
Giving the wrong complexity
Writing O(n) or O(n²) as the time complexity of merge sort.
Fix itState that merge sort has time complexity O(n log n).
Related topics