TX CS 2: 127.763.c.4.o

CodeHS Lessons

Compare and contrast algorithm efficiency by using informal runtime comparisons, exact calculation of statement execution counts, and theoretical efficiency values using "big-O" notation, including worst-case, best-case, and average-case time/space analysis;

AP Computer Science A (Nitro)

Standard

4.5 Informal Code Analysis

10.3 Recursive Sorting

11.3 Recursive Sorting

AP Computer Science A (Mocha)

Standard

8.1 What is an Algorithm?

8.2 Linear Search

8.3 Binary Search

8.5 Insertion Sort

8.6 Advanced: Recursion

8.7 Mergesort

8.8 Informal Code Analysis

Arizona Software and App Design II

Standard

6.5 Informal Code Analysis

9.1 What is an Algorithm?

9.2 Linear Search

9.3 Binary Search

9.5 Insertion Sort

9.7 Mergesort

9.8 Informal Code Analysis

Nevada Computer Science 2

Standard

9.1 What is an Algorithm?

9.2 Linear Search

9.3 Binary Search

9.5 Insertion Sort

9.6 Advanced: Recursion

9.7 Mergesort

9.8 Informal Code Analysis

Nevada Advanced Computer Science I

Standard

11.1 What is an Algorithm?

IB Computer Science Standard Level

Standard

10.5 Informal Code Analysis

17.3 Recursive Sorting

IB Computer Science Higher Level (Year One)

Standard

10.5 Informal Code Analysis

15.3 Recursive Sorting

Texas Computer Science 2

Standard

9.1 What is an Algorithm?

9.2 Linear Search

9.3 Binary Search

9.5 Insertion Sort

9.6 Advanced: Recursion

9.7 Mergesort

9.8 Informal Code Analysis