Each learning path is one chapter: a guided route through a topic, one small course at a time. Pick a class to see its chapters in order.
Before anyone writes a program, someone has to plan it. What must it do? What are its parts? What steps solve each part? This chapter shows how a programmer plans, writes down and checks an algorithm. You break a problem into smaller parts, draw flowcharts and structure diagrams, write pseudocode, follow an algorithm step by step in a trace table, choose test data, and find and fix errors. Then you learn the standard methods that every programmer uses: totals, counts, the largest and smallest values, averages, linear search, bubble sort and checks on input data. It covers unit 7 of Cambridge IGCSE Computer Science, Algorithm design and problem-solving, and it builds on the Python books of the site.