Please enable JavaScript to use CodeHS

MD 11-12: 12.AP.M.02

CodeHS Lessons

Analyze a large-scaled computational problem and identify generalizable patterns that can be applied to a solution.

8.1 What is an Algorithm?
8.4 Selection Sort
8.5 Insertion Sort
8.7 Mergesort
9.1 What is an Algorithm?
9.4 Selection Sort
9.5 Insertion Sort
9.7 Mergesort
14.1 Arduino Challenges
14.4 Final Project
12.1 Arduino Challenges
12.4 Final Project
3.1 Arduino Challenges
3.4 Final Project
10.1 micro:bit Challenges
10.4 Final Project
9.1 micro:bit Challenges
9.4 Final Project
3.1 micro:bit Challenges
3.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
10.1 micro:bit Challenges
10.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project
15.1 micro:bit Challenges
15.4 Final Project