0Standard algorithms serve as good solutions to standard problems. These algorithms, many of which are intertwined with data structures, provide excellent examples for the analysis of program efficiency. Programs that implement standard algorithms also serve as good models for program design. Many standard algorithms involve array operations: traversing an array, inserting and deleting an element, and searching (both sequential and binary searches). Standard sorts also manipulate the elements of arrays. (See chapter 2 for suggestions that involve visual representations of these algorithms.) Students also need to analyze these standard algorithms, either informally (in the AP Computer Science A course) or formally (in AP Computer Science AB). As can be expected, the AP Computer Science AB course also deals with standard algorithms that are associated with the additional data structures in its curriculum.
