Work through the list without notes. If you cannot do a statement, follow the pointer, then come back. Guide = the study guide; Practice = the practice questions.
Understanding
- I can describe the steps of binary search (Guide: How binary search works; Practice: Question 6)
- I can state that binary search needs sorted data and explain why (Guide: How binary search works; Practice: Questions 1 and 2)
- I can explain that each check eliminates about half of the remaining data (Guide: How binary search works; Practice: Question 8)
Skills
- I can find the middle position of a sorted list (Guide: Worked example 1; Practice: Question 5)
- I can trace a binary search and record each comparison (Guide: Worked example 1; Practice: Question 9)
- I can find the greatest number of checks for a list of a given size (Guide: Worked example 2, Part A; Practice: Questions 3 and 10)
- I can compare binary and linear search for lists of different sizes (Guide: Worked example 2, Part A; Practice: Question 10)
Reasoning
- I can predict the effect on the number of checks when the list size doubles (Guide: Worked example 2, Part A; Practice: Question 4)
- I can explain how binary search fails on unsorted data (Guide: Worked example 2, Part B; Practice: Question 10)
- I can choose between linear and binary search for a scenario (Guide: Choosing between linear and binary search; Practice: Question 7)
- I can explain why binary search is not always faster than linear search (Guide: Common misconceptions; Practice: Question 8)
- I can state which elements are eliminated after a comparison (Guide: How binary search works; Practice: Question 6)
When every line is secure, move on. The revision notes are here: revision notes.