# Natrona Computer Programming 2: L2.AP.A.01

## CodeHS Lessons

Critically examine and trace classic algorithms. Use and adapt classic algorithms to solve computational problems (e.g., selection sort, insertion sort, binary search, linear search).

 Standard 7.5 Searching 7.6 Sorting
 Standard 4.6 For Loops in JavaScript 4.8 For Loop Practice 7.5 Iterating Over an Array 7.6 Finding an Element in a List 7.7 Removing an Element From an Array
 Standard 4.6 For Loops in Python 7.3 For Loops and Lists 7.4 List Methods
 Standard 4.7 For Loops in JavaScript 4.9 For Loop Practice 7.5 Iterating Over an Array 7.6 Finding an Element in a List 7.7 Removing an Element From an Array
 Standard 8.4 Selection Sort 8.8 Informal Code Analysis
 Standard 4.6 For Loops in JavaScript 4.8 For Loop Practice 7.5 Iterating Over an Array 7.6 Finding an Element in a List 7.7 Removing an Element From an Array
 Standard 3.5 For Loops in JavaScript 3.7 For Loop Practice 6.5 Iterating Over an Array 6.6 Finding an Element in a List 6.7 Removing an Element From an Array
 Standard 3.5 For Loops in JavaScript 3.7 For Loop Practice 6.5 Iterating Over an Array 6.6 Finding an Element in a List 6.7 Removing an Element From an Array
 Standard 3.6 For Loops in JavaScript 3.8 For Loop Practice 4.5 Iterating Over an Array 4.6 Finding an Element in a List 4.7 Removing an Element From an Array
 Standard 3.6 For Loops in Python 6.3 For Loops and Lists 6.4 List Methods
 Standard 2.6 For Loops in Python 4.3 For Loops and Lists 4.4 List Methods
 Standard 2.6 For Loops in Python 4.3 For Loops and Lists 4.4 List Methods
 Standard 14.5 Searching 14.6 Sorting
 Standard 13.5 Searching 13.6 Sorting
 Standard 9.4 Selection Sort 9.8 Informal Code Analysis