Please enable JavaScript to use CodeHS

TX CS 2: 127.763.c.4.i

  1. Frameworks
  2. Texas Computer Science 2

CodeHS Lessons

Measure time/space efficiency of various sorting algorithms;

AP Computer Science A (Nitro)
Standard
4.5 Informal Code Analysis
7.5 Searching

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
7.5 Informal Code Analysis
10.2 Linear Search
10.3 Binary Search
10.4 Selection Sort
10.5 Insertion Sort
10.7 Mergesort

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

IB Computer Science Standard Level
Standard
10.5 Informal Code Analysis
14.5 Searching

IB Computer Science Higher Level (Year One)
Standard
10.5 Informal Code Analysis
13.5 Searching

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