40 questions drilling bubble sort, merge sort, insertion sort, selection sort, plus linear and binary search — the algorithms topic students forget fastest.
Full description:
Sorting and searching algorithms are usually taught once and then forgotten, because students memorise the steps for a lesson and never revisit them. This quiz forces genuine recall with 40 questions that mix “how does this algorithm work” with applied questions about passes, comparisons and efficiency, so the difference between bubble sort and insertion sort actually sticks.
• 40 auto-marked questions covering bubble sort, merge sort, insertion sort and selection sort
• Also covers linear search and binary search
• Mixes recall questions (how the algorithm works) with applied questions (number of passes, comparisons, efficiency)
• Every question includes a full worked explanation
• Runs as a single HTML file: no login, no install, works on any school device
Use it as retrieval practice a few weeks after teaching sorting algorithms, as revision homework before a mock, or as a starter to check which algorithm students are still mixing up.