Tick each line when you can do it without looking at the guide. Each line names where it is taught and tested. Revisit the study guide for anything you cannot yet do.
Understanding
- ☐ I can explain how a recursive method traverses a String, array or ArrayList (study guide: Recursion over a collection; practice: Question 8).
- ☐ I can explain why binary search needs sorted data (study guide: Binary search; practice: Questions 1 and 5).
- ☐ I can explain why binary search is typically more efficient than linear search (study guide: Worked example 1; practice: Question 9).
- ☐ I can describe merge sort as divide, sort each half recursively and merge (study guide: Merge sort; practice: Question 10).
Skills
- ☐ I can trace a binary search with a low, high and mid table (study guide: Worked example 1; practice: Questions 2, 3 and 4).
- ☐ I can state the correct updates to low and high after each comparison (study guide: Binary search; Common misconceptions).
- ☐ I can write the splits and merges of merge sort on a short array in order (study guide: Worked example 2; practice: Questions 6, 7 and 10).
- ☐ I can merge two sorted lists by comparing their front elements (study guide: Merge sort).
Reasoning
- ☐ I can predict the result of binary search on unsorted data (study guide: Worked example 1; practice: Question 5).
- ☐ I can count the comparisons binary search makes for a given target (practice: Questions 3, 4 and 9).
- ☐ I can say which half merge sort finishes first and which merge happens first (study guide: Worked example 2; practice: Question 7).
- ☐ I can state which search and sort algorithms are within the course and which are not (study guide: Scope).
Next: take the Unit 4 diagnostic and read the Unit 4 review.