Arrays, Accumulator Patterns, Searching, and Sorting

Where you are: Week 0 review > Arrays, search, and sort

This part of the review is three short lessons. Work them in order:

1. Arrays and accumulator patterns: indexing, length, and the sum, count, min, and max patterns.
2. Searching an array: linear search, and binary search with its sorted precondition.
3. Sorting: the three-statement swap, selection sort, and insertion sort.

These close the Week 0 review. The bridge into CSCD 211 is the next anchor, Comparable, composition, and Comparator.

Resources

Canonical: BJP (Reges and Stepp) Ch 7 (arrays), §13.1 and §13.3 (searching and sorting); Liang 10e §7 (Single-Dimensional Arrays). Section numbers are grounded from the published tables of contents; exact page numbers depend on the printing and are pending a faculty spot-check.