Due 21 Sept 2026 · Problems 1 and 2 + reading
Complete Problems 1 and 2 in the algorithms handout, then read the textbook’s binary-search section. Have your work ready for Monday, 21 September.
Use the B2.4 Algorithms student handout, pages 3–4. Complete all parts of Problem 1 (Classify and explain) and Problem 2 (Predict growth and memory). Give reasons where requested. Stop after Problem 2; Problems 3 onwards are not assigned this weekend.
Start at the Binary search heading on printed page 363 and read through the search comparison at the top of page 365. Stop at B2.4.3 Bubble sort and selection sort. Focus on why the input must be sorted and how low, mid and high change.
In the textbook’s Python example, initialize upper = len(numbers) - 1, not len(numbers). The last index is one less than the number of items. The handout uses the correct boundary.
Have your answers to Problems 1 and 2 ready for Monday’s lesson.
Watch the binary-search animation →
The binary-search animation can help with the reading. The written homework is Problems 1 and 2 only. Textbook page numbers are the numbers printed on the page, not the PDF viewer’s counter.