Please enable JavaScript to use CodeHS

OK 11-12: L2.AP.A.03

CodeHS Lessons

Critically examine and trace classic algorithms (e.g., selection sort, insertion sort, binary search, linear search).

Standard
7.5 Searching
7.6 Sorting
10.2 Recursive Searching
10.3 Recursive Sorting
Standard
7.7 Removing an Element From an Array
Standard
7.7 Removing an Element From an Array
Standard
8.6 Finding an Element in a List
8.7 Removing an Element From an Array
Standard
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort
8.7 Mergesort
Standard
7.7 Removing an Element From an Array
Standard
6.7 Removing an Element From an Array
Standard
6.7 Removing an Element From an Array
Standard
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.7 Mergesort
Standard
4.7 Removing an Element From an Array
Standard
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.7 Mergesort
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