Give students a large data file to sort when teaching sorting algorithms to remind students that computers are great at dealing with a large set of data.
Have students sort large signs their classmates hold to better visualize different sorting algorithms. However, be mindful of unsuitable factors to sort by, such as height and weight.
Encourage student groups to proceed through the phases of problem solving in order, rather than completely testing only one problem solution at a time, to make them more productive.
Build a paper airplane instead of the PB&J exercise for a less messy, more extensible algorithms introduction activity.
Tie the importance of searching and sorting to internet search engines, then encourage students to create search mechanisms for data they want to analyze.
Have students reason about optimization by creating a program that’ll make an 80 minute playlist for a party.
Introduce memory and efficiency a few months into the AP CS course. Do so in a hands-on way by demonstrating how a computer cannot compute a slow problem.
When learning in a playful context, students are less likely to be frustrated by difficulty or failure.
To integrate CS with other disciplines, have students write algorithms for activities they’re already doing for other classes.
Use examples that have nothing to do with computers to introduce new CS concepts in an accessible way.