# MD 11-12: 12.AP.A.04

## CodeHS Lessons

Analyze and refine classic algorithms to solve problems.

 8.2 Linear Search 8.3 Binary Search 8.4 Selection Sort 8.5 Insertion Sort 8.7 Mergesort
 9.2 Linear Search 9.3 Binary Search 9.4 Selection Sort 9.5 Insertion Sort 9.7 Mergesort
 9.14 Array Length and Looping Through Arrays
 26.4 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 17.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 12.4 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 12.13 Array Length and Looping Through Arrays
 11.13 Array Length and Looping Through Arrays
 9.22 Array Length and Looping Through Arrays
 10.13 Array Length and Looping Through Arrays
 12.4 Array Length and Looping Through Arrays
 21.4 Array Length and Looping Through Arrays
 25.4 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 9.13 Array Length and Looping Through Arrays
 12.4 Developing Algorithms Using Arrays 13.4 Developing Algorithms using ArrayLists 13.5 Searching 13.6 Sorting 15.2 Recursive Searching 15.3 Recursive Sorting
 13.4 Developing Algorithms Using Arrays 14.4 Developing Algorithms using ArrayLists 14.5 Searching 14.6 Sorting 17.2 Recursive Searching 17.3 Recursive Sorting
 6.4 Developing Algorithms Using Arrays 7.4 Developing Algorithms using ArrayLists 7.5 Searching 7.6 Sorting 10.2 Recursive Searching 10.3 Recursive Sorting