CS106B Programming Abstractions

Course (expand submenu)
Resources (expand submenu)
LaIR Ed Discussion Forum Paperless Qt Installation Guide C++ Reference Stanford Library Documentation Style Guide Testing Guide Classes Syntax Reference Sheet Python to C++ Guide Submission Checklist Textbook
Lectures (expand submenu)
Lecture 1: Welcome to CS106B Lecture 2: From Python to C++ Lecture 3: More C++ Intro: Parameters, Testing Lecture 4: Vectors and Grids Lecture 5: Stacks and Queues Lecture 6: Sets and Maps Lecture 7: Big O and Asymptotic Analysis Lecture 8: Introduction to Recursion Lecture 9: Recursion 2 Lecture 10: Recursion Sequences Lecture 11: Backtracking 1 Lecture 12: Backtracking 2 Lecture 13: C++ Classes Lecture 14: Dynamic Memory Lecture 15: Pointers Lecture 16: Heaps Lecture 17: Linked Lists 1 Lecture 18: Linked Lists 2 Lecture 19: Sorting Lecture 20: Binary Search Trees Lecture 21: More Binary Search Trees
Assignments (expand submenu)
About Assignments Assignment 0: Welcome to CS106B Assignment 1: Getting your C++ Legs Assignment 2: Fun with Collections Assignment 3: Recursion Etudes Assignment 4: Backtracking Assignment 5: Classes Assignment 6: Linked Lists
Sections (expand submenu)
About Sections 1. C++ Fundamentals 2. ADTs, Big-O, and Intro to Recursion 3. Recursion and Intro to Backtracking 4. Recursive Backtracking 5. Classes and Dynamic Memory 6. Memory Management, Pointers, and Linked Lists 7. Linked Lists and Trees
Assessments (expand submenu)
🗓Schedule

Big O and Asymptotic Analysis

Lecture 7: Big O and Asymptotic Analysis

CS 106B: Programming Abstractions

An image showing the various graphs associated with n, log(n), n log n, n^2, n^3, and 2^n (all things we will learn about today

Materials for Today

Lecture Slides (pdf)
(no lecture code today)

← Previous Post

• © 2026 • CS106B Programming Abstractions

Hugo v0.150.0 powered • Theme Beautiful Hugo adapted from Beautiful Jekyll