Please enable JavaScript to use CodeHS

IB Computer Science SL Resources

Algorithms

Students analyze how long algorithms take to run, express efficiency in Big O notation, and implement and compare the standard search and sort algorithms.

Lessons

9.1 Informal Runtime Analysis

  • Informal Runtime Analysis
  • Evaluating Algorithms with Statement Execution Counts
  • Evaluating Algorithms with Statement Execution Counts Submission
  • Exploration: Statement Execution Count
  • Informal Runtime Analysis Quiz
  • +2 more

9.2 Big O Notation

  • Introduction to Logarithms
  • Big O Notation
  • Big O Quiz
  • Big O Runtime Examples
  • Exploration: Fast vs Slow Searching
  • +4 more

9.3 Linear Search

  • Introduction to Linear Search
  • Searching a List of Fruit
  • Exploration: Forward and Reverse Search
  • Linear Search Quiz
  • Draft Day Search
  • +1 more

9.4 Binary Search

  • Guess the Number
  • Guess the Number Reflection
  • Binary Search
  • Binary Search Quiz
  • Smart Closet

9.5 Bubble Sort

  • Loops Review
  • Swapping in Python
  • Swapping Reflection
  • Fix the Date
  • Bubble Sort Quiz
  • +4 more

9.6 Selection Sort

  • Selection Sort
  • Selection Sort Simulation
  • Exploration: Selection Sort
  • Selection Sort

Courses that include this module