Please enable JavaScript to use CodeHS

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

  1. Frameworks
  2. Oklahoma 11-12 (2018)

CodeHS Lessons

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

AP Computer Science A (Nitro)
Standard
7.5 Searching
7.6 Sorting
10.2 Recursive Searching
10.3 Recursive Sorting
11.2 Recursive Searching
11.3 Recursive Sorting

AP Computer Science Principles in JavaScript
Standard
7.7 Removing an Element From an Array

AP Computer Science Principles: Cybersecurity
Standard
7.7 Removing an Element From an Array

AP Computer Science A (Mocha)
Standard
8.2 Linear Search
8.3 Binary Search
8.4 Selection Sort
8.5 Insertion Sort
8.7 Mergesort

Video Game Design in JavaScript (2022)
Standard
8.6 Finding an Element in a List
8.7 Removing an Element From an Array

Arizona Software and App Design II
Standard
10.2 Linear Search
10.3 Binary Search
10.4 Selection Sort
10.5 Insertion Sort
10.7 Mergesort

Georgia Computer Science Principles
Standard
7.7 Removing an Element From an Array

New Jersey Computer Science
Standard
6.7 Removing an Element From an Array

New Jersey Computer Science and Design Thinking
Standard
6.7 Removing an Element From an Array

Nevada Computer Science 2
Standard
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.7 Mergesort

North Carolina Intro to Computer Science
Standard
4.7 Removing an Element From an Array

IB Computer Science Standard Level
Standard
14.5 Searching
14.6 Sorting
17.2 Recursive Searching
17.3 Recursive Sorting

IB Computer Science Higher Level (Year One)
Standard
13.5 Searching
13.6 Sorting
15.2 Recursive Searching
15.3 Recursive Sorting

Texas Computer Science 2
Standard
9.2 Linear Search
9.3 Binary Search
9.4 Selection Sort
9.5 Insertion Sort
9.7 Mergesort