WY L2: 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).

AP Computer Science Principles in JavaScript

Standard

7.5 Iterating Over an Array

7.6 Finding an Element in a List

7.7 Removing an Element From an Array

AP Computer Science Principles: Cybersecurity

Standard

7.5 Iterating Over an Array

7.6 Finding an Element in a List

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

Arizona Software and App Design II

Standard

9.2 Linear Search

9.3 Binary Search

9.4 Selection Sort

9.5 Insertion Sort

9.7 Mergesort

Georgia Computer Science Principles

Standard

7.5 Iterating Over an Array

7.6 Finding an Element in a List

7.7 Removing an Element From an Array

New Jersey Computer Science

Standard

6.5 Iterating Over an Array

6.6 Finding an Element in a List

6.7 Removing an Element From an Array

New Jersey Computer Science and Design Thinking

Standard

6.5 Iterating Over an Array

6.6 Finding an Element in a List

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 (2020)

Standard

4.5 Iterating Over an Array

4.6 Finding an Element in a List

4.7 Removing an Element From an Array

Texas Computer Science 2

Standard

9.2 Linear Search

9.3 Binary Search

9.4 Selection Sort

9.5 Insertion Sort

9.7 Mergesort