Algorithms: Searching and Sorting: revision quiz and key terms
Free practice for Algorithms: Searching and Sorting in KS3 Computing (Years 7–9). It covers: what an algorithm is, linear and binary search, bubble sort and merge sort, comparing efficiency, tracing short lists, and algorithms vs programs. Try the questions, then check the key terms.
Try 5 free questions
How is an algorithm different from a program?
For large lists, merge sort is usually faster than bubble sort.
Bubble sort puts 4, 1, 3 into order, smallest first. What is the list after one full pass?
Linear search only works if the list is sorted first.
Binary search looks for 50 in 10, 20, 30, 40, 50, 60, 70. Which item is checked first?
In RADevo, this topic has fill-in-the-blank, matching, multiple-choice and true or false activities, and every question you get wrong comes back in Revise today until you've learnt it.
Key terms for Algorithms: Searching and Sorting
- Best case
- When an algorithm finishes in the fewest steps, such as finding the target first.
- Binary search
- Checks the middle item, then throws away half the list each time.
- Bubble sort
- Compares neighbouring pairs and swaps them, repeating passes until everything is in place.
- Descending order
- Arranged from largest to smallest, or Z to A.
- Dry run
- Working through an algorithm by hand to see what it does.
- Linear search
- Checks each item in turn from the start until the target is found.
- Midpoint
- The item halfway along the part of the list being searched.
- Trace table
- A grid used to record the values of variables at each step.
Teaching KS3 Computing (Years 7–9)?
Set this topic as homework in two clicks, see who has done it and which questions your class got wrong, and start every lesson with a Do Now built from their mistakes.
Start a free 2-week trialRevising for this?
If your school uses RADevo, sign in to do the full quizzes and keep your progress. If it doesn't, show this page to your Computing teacher.
Log in to RADevo