Please enable JavaScript to use CodeHS

Arizona Software and App Design II

Algorithms and Recursion

Students learn fundamental searching and sorting algorithms, as well as the important concept of recursion.

Lessons

12.1 What is an Algorithm?

  • What is an Algorithm?
  • Every Day Algorithms
  • Big O Notation
  • Big O Notation
  • Space Complexity
  • +1 more

12.2 Linear Search

  • Linear Search
  • Linear Search
  • Linear Search on ArrayList
  • Gradebook FRQ

12.3 Binary Search

  • Binary Search
  • Binary Search
  • Binary Search
  • Binary vs Linear
  • Comparing Binary Search and Linear Search
  • +1 more

12.4 Selection Sort

  • Selection Sort
  • Selection Sort
  • Selection Sort
  • Visualizing Algorithms
  • Explore Selection Sort

12.5 Insertion Sort

  • Insertion Sort
  • Insertion Sort
  • Visualizing Algorithms
  • Insertion Sort
  • Explore Insertion Sort
  • +2 more

12.6 Recursion

  • Recursion
  • Quiz: Recursion
  • Summing
  • Sum Array
  • Fibonacci Recursion
  • +4 more

12.7 Mergesort

  • Mergesort
  • Visualizing Algorithms
  • Merge Sort
  • Explore Merge Sort
  • Algorithms Badge

12.8 Informal Code Analysis

  • Informal Code Analysis
  • Informal Code Analysis
  • Loop Execution Count
  • While Loop Time
  • For Loop Time
  • +4 more

12.9 Algorithms and Recursion Quiz

  • Algorithms and Recursion Quiz

Courses that include this module