- What is CodeHS?
- Curriculum
- Platform
- Assignments
- Classroom Management
- Grading
- Gradebook
- Progress Tracking
- Lesson Plans
- Offline Handouts
- Problem Guides
- Practice
- Create
- Problem Bank
- Playlist Bank
- Quiz Scores
- Rostering
- Integrations
- Professional Development
- Stories
- Standards
- States
- Alabama
- Alaska
- Arizona
- Arkansas
- California
- Colorado
- Connecticut
- D.C.
- Delaware
- Florida
- Georgia
- Hawaii
- Idaho
- Illinois
- Indiana
- Iowa
- Kansas
- Kentucky
- Louisiana
- Maine
- Maryland
- Massachusetts
- Michigan
- Minnesota
- Mississippi
- Missouri
- Montana
- Nebraska
- Nevada
- New Hampshire
- New Jersey
- New Mexico
- New York
- North Carolina
- North Dakota
- Ohio
- Oklahoma
- Oregon
- Pennsylvania
- Rhode Island
- South Carolina
- South Dakota
- Tennessee
- Texas
- Utah
- Vermont
- Virginia
- Washington
- West Virginia
- Wisconsin
- Wyoming
- State Standards
- Plans
- Resources
- Districts
- Share
- Contact Us
- Company
CA SSD: C4.10
CodeHS Lessons
Create and know the comparative advantages of various queue, sorting, and searching algorithms.
Standard |
10.1 Indexing |
10.2 Slicing |
10.4 Strings and For Loops |
12.3 For Loops and Lists |
Standard |
7.5 Searching |
7.6 Sorting |
10.2 Recursive Searching |
10.3 Recursive Sorting |
11.2 Recursive Searching |
11.3 Recursive Sorting |
Standard |
7.1 Intro to Lists/Arrays |
7.2 Indexing Into an Array |
7.3 Adding/Removing From an Array |
7.4 Array Length and Looping Through Arrays |
7.5 Iterating Over an Array |
7.6 Finding an Element in a List |
7.7 Removing an Element From an Array |
33.3 Iterating Over an Object |
33.7 Looping Over a Grid |
Standard |
33.1 Indexing |
33.2 Slicing |
33.4 Strings and For Loops |
Standard |
7.1 Intro to Lists/Arrays |
7.2 Indexing Into an Array |
7.3 Adding/Removing From an Array |
7.4 Array Length and Looping Through Arrays |
7.5 Iterating Over an Array |
7.6 Finding an Element in a List |
7.7 Removing an Element From an Array |
37.3 Iterating Over an Object |
37.7 Looping Over a Grid |
Standard |
8.1 Indexing |
8.2 Slicing |
8.4 Strings and For Loops |
9.3 For Loops and Lists |
Standard |
7.1 Indexing |
7.2 Slicing |
7.4 Strings and For Loops |
8.3 For Loops and Lists |
Standard |
9.1 What is an Algorithm? |
9.2 Linear Search |
9.3 Binary Search |
9.5 Insertion Sort |
Standard |
9.1 Indexing |
9.2 Slicing |
9.4 Strings and For Loops |
10.3 For Loops and Lists |
Standard |
7.1 Intro to Lists/Arrays |
7.2 Indexing Into an Array |
7.3 Adding/Removing From an Array |
7.4 Array Length and Looping Through Arrays |
7.5 Iterating Over an Array |
7.6 Finding an Element in a List |
7.7 Removing an Element From an Array |
32.3 Iterating Over an Object |
32.7 Looping Over a Grid |
Standard |
8.1 Indexing |
8.2 Slicing |
8.4 Strings and For Loops |
9.3 For Loops and Lists |
Standard |
6.3 For Loops and Lists |
Standard |
6.1 Intro to Lists/Arrays |
6.2 Indexing Into an Array |
6.3 Adding/Removing From an Array |
6.4 Array Length and Looping Through Arrays |
6.5 Iterating Over an Array |
6.6 Finding an Element in a List |
6.7 Removing an Element From an Array |
27.3 Iterating Over an Object |
27.7 Looping Over a Grid |
Standard |
6.1 Intro to Lists/Arrays |
6.2 Indexing Into an Array |
6.3 Adding/Removing From an Array |
6.4 Array Length and Looping Through Arrays |
6.5 Iterating Over an Array |
6.6 Finding an Element in a List |
6.7 Removing an Element From an Array |
28.3 Iterating Over an Object |
28.7 Looping Over a Grid |
Standard |
9.1 What is an Algorithm? |
9.2 Linear Search |
9.3 Binary Search |
9.5 Insertion Sort |
Standard |
11.1 What is an Algorithm? |
Standard |
4.1 Intro to Lists/Arrays |
4.2 Indexing Into an Array |
4.3 Adding/Removing From an Array |
4.4 Array Length and Looping Through Arrays |
4.5 Iterating Over an Array |
4.6 Finding an Element in a List |
4.7 Removing an Element From an Array |
15.3 Iterating Over an Object |
15.7 Looping Over a Grid |
Standard |
4.1 Indexing |
4.2 Slicing |
4.4 Strings and For Loops |
Standard |
18.1 Indexing |
18.2 Slicing |
18.4 Strings and For Loops |
Standard |
15.1 Indexing |
15.2 Slicing |
15.4 Strings and For Loops |
Standard |
15.1 Indexing |
15.2 Slicing |
15.4 Strings and For Loops |
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 |
Standard |
2.1 Indexing |
2.2 Slicing |
2.4 Strings and For Loops |
4.3 For Loops and Lists |
Standard |
10.1 Indexing |
10.2 Slicing |
10.4 Strings and For Loops |
12.3 For Loops and Lists |
Standard |
2.1 Indexing |
2.2 Slicing |
2.4 Strings and For Loops |
4.3 For Loops and Lists |
Standard |
6.3 For Loops and Lists |
- What is CodeHS?
- Curriculum
- Platform
- Assignments
- Classroom Management
- Grading
- Gradebook
- Progress Tracking
- Lesson Plans
- Offline Handouts
- Problem Guides
- Practice
- Create
- Problem Bank
- Playlist Bank
- Quiz Scores
- Rostering
- Integrations
- Professional Development
- Stories
- Standards
- States
- Alabama
- Alaska
- Arizona
- Arkansas
- California
- Colorado
- Connecticut
- D.C.
- Delaware
- Florida
- Georgia
- Hawaii
- Idaho
- Illinois
- Indiana
- Iowa
- Kansas
- Kentucky
- Louisiana
- Maine
- Maryland
- Massachusetts
- Michigan
- Minnesota
- Mississippi
- Missouri
- Montana
- Nebraska
- Nevada
- New Hampshire
- New Jersey
- New Mexico
- New York
- North Carolina
- North Dakota
- Ohio
- Oklahoma
- Oregon
- Pennsylvania
- Rhode Island
- South Carolina
- South Dakota
- Tennessee
- Texas
- Utah
- Vermont
- Virginia
- Washington
- West Virginia
- Wisconsin
- Wyoming
- State Standards
- Plans
- Resources
- Districts
- Share
- Contact Us
- Company