# WV M: CS.M.12

## CodeHS Lessons

Examine classical algorithms (e.g., searching, sorting, and shortest path).

 Standard 25.6 Finding an Element in a List
 Standard 7.5 Searching 7.6 Sorting 10.2 Recursive Searching 10.3 Recursive Sorting
 Standard 7.4 Array Length and Looping Through Arrays
 Standard 7.4 Array Length and Looping Through Arrays
 Standard 16.2 Finding an Element in a List
 Standard 8.2 Linear Search 8.3 Binary Search 8.4 Selection Sort 8.5 Insertion Sort 8.7 Mergesort
 Standard 16.2 Finding an Element in a List
 Standard 13.2 Finding an Element in a List
 Standard 17.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 18.2 Finding an Element in a List
 Standard 7.4 Array Length and Looping Through Arrays
 Standard 19.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 26.6 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 6.4 Array Length and Looping Through Arrays
 Standard 6.4 Array Length and Looping Through Arrays
 Standard 16.2 Finding an Element in a List
 Standard 9.2 Linear Search 9.3 Binary Search 9.4 Selection Sort 9.5 Insertion Sort 9.7 Mergesort
 Standard 4.4 Array Length and Looping Through Arrays
 Standard 16.2 Finding an Element in a List
 Standard 18.2 Finding an Element in a List
 Standard 12.6 Finding an Element in a List
 Standard 9.2 Linear Search 9.3 Binary Search 9.4 Selection Sort 9.5 Insertion Sort 9.7 Mergesort
 Standard 16.2 Finding an Element in a List
 Standard 16.2 Finding an Element in a List
 Standard 12.6 Finding an Element in a List
 Standard 21.6 Finding an Element in a List
 Standard 14.5 Searching 14.6 Sorting 17.2 Recursive Searching 17.3 Recursive Sorting
 Standard 13.5 Searching 13.6 Sorting 15.2 Recursive Searching 15.3 Recursive Sorting