ND 9-12: 11.PSA.1
CodeHS Lessons
Demonstrate ways a given algorithm applies to problems across disciplines and explain the benefits and drawbacks of choices made.
| Standard |
| 12.4 Final Project |
| Standard |
| 14.4 Final Project |
| Standard |
| 9.4 Final Project |
| Standard |
| 10.4 Final Project |
| Standard |
| 3.4 Final Project |
| Standard |
| 3.4 Final Project |
| Standard |
| 3.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 8.1 What is an Algorithm? |
| 8.2 Linear Search |
| 8.3 Binary Search |
| 8.4 Selection Sort |
| 8.5 Insertion Sort |
| 8.6 Advanced: Recursion |
| 8.7 Mergesort |
| Standard |
| 9.1 What is an Algorithm? |
| 9.2 Linear Search |
| 9.3 Binary Search |
| 9.4 Selection Sort |
| 9.5 Insertion Sort |
| 9.7 Mergesort |
| Standard |
| 15.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 12.4 Final Project |
| Standard |
| 10.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 7.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 9.1 What is an Algorithm? |
| 9.2 Linear Search |
| 9.3 Binary Search |
| 9.4 Selection Sort |
| 9.5 Insertion Sort |
| 9.6 Advanced: Recursion |
| 9.7 Mergesort |
| Standard |
| 11.1 What is an Algorithm? |
| Standard |
| 15.4 Final Project |
| Standard |
| 15.4 Final Project |
| Standard |
| 9.1 What is an Algorithm? |
| 9.2 Linear Search |
| 9.3 Binary Search |
| 9.4 Selection Sort |
| 9.5 Insertion Sort |
| 9.6 Advanced: Recursion |
| 9.7 Mergesort |
| Standard |
| 15.4 Final Project |
| Standard |
| 8.3 Final Project |
| 11.4 Final Project |
| Standard |
| 8.3 Final Project |
