suggested for ages 14-18
This course briefly reviews Python fundamentals and focuses on advanced topics in Python: recursion, searching and sorting algorithms, and big-O notation. The master project for this course requires students to rely on their analytical reasoning skills to recognize patterns, outline solutions to problems, and systematically develop algorithms that can handle rigorous testing.
Students who excel in this course have a strong math background (Algebra 2 or higher recommended).
This course typically takes 3-6 months to complete. This depends on the student's dedication to homework, their previous experience, and the difficulty of course material. Our instructors move at the pace of the student, taking extra time to reinforce concepts as needed.
AM1 Review: Variables, Strings, Input, Loops, & Conditionals
AM2 Review: Functions & Lists
AM3 Review: Dictionaries & Recap
AM4 Recursion Part 1
AM5 Recursion Part 2
AM6 Introduction to Algorithms & Runtime Analysis
AM7 Binary Search
AM8 Selection Sort & Insertion Sort
AM9 Bubble Sort
AM10 Merge Sort
AM12 File Input/Output
AM13 Master Problem: Conway’s Game of Life
AM14 Master Problem: Tic Tac Toe AI