Algorithm efficiency and multidimensional arrays

Lecture materials

Read Week 8 → · Slides (PDF · 67 pages) ↓

Principles

Compare linear and binary search, insertion sort, correctness and termination; explain growth in work and time/memory tradeoffs.

Application and programming

Revisit one-dimensional traversal, then trace rows, columns, nested loops and boundary checks in a two-dimensional array.

Practice and coordination

Recitation: Draw the table first, then trace two indices. Repeat function and loop questions.

Combined weekly schedule → · CSE107 lab week →