Skip to content

Subject

Data structures, by topic.

Continue

Contents

C and memory

Programs and memory in C

  1. A first C program , essential
  2. Variables live in memory , essential
  3. Functions and the call stack , essential
  4. Structs , essential

Pointers and the heap

  1. Pointers and addresses , essential
  2. Passing pointers to functions , essential
  3. Arrays and pointer arithmetic , essential
  4. The heap: malloc and free , essential
  5. Memory errors

Data structures and their cost

  1. Physical and logical structures , essential
  2. Counting steps , essential
  3. Time and space complexity , essential

Recursion

Recursion

  1. Recursion , essential
  2. Head and tail recursion
  3. Tree recursion , essential
  1. Indirect and nested recursion
  2. Fast powers
  3. Taylor series and Horner's rule
  1. Memoisation , essential
  2. Binomial coefficients
  3. The Tower of Hanoi

Arrays and strings

Arrays

  1. Arrays of two and more dimensions , essential
  2. Inserting and deleting in an array , essential
  1. Linear search , essential
  2. Binary search , essential
  3. Merging and set operations
  4. Dynamic arrays , essential

Strings

  1. Strings in C , essential
  2. Working with strings
  3. Counting and bitmasks
  4. Permutations

Lists, stacks and queues

Linked lists

  1. Singly linked lists , essential
  2. Removing from a linked list
  3. Reversing a list , essential
  4. Merging sorted lists
  5. Circular lists
  6. Doubly linked lists , essential
  7. Skip lists

Stacks

  1. Stacks , essential
  2. Matching brackets , essential
  3. Infix to postfix , essential
  4. Evaluating postfix

Queues

  1. Queues , essential
  2. Circular queues , essential
  3. Double-ended queues
  4. Priority queues , essential

Matrices and polynomials

Special matrices

  1. Diagonal matrices
  2. Triangular and symmetric matrices
  1. Tridiagonal and banded matrices
  2. Toeplitz matrices
  3. Sparse matrices in arrays
  4. Sparse matrices as linked lists

Polynomials

  1. Storing a polynomial
  2. Adding polynomials
  3. Multiplying polynomials

Trees

Members: Free account

Trees

  1. Binary trees , essential
  2. Storing trees
  3. Tree traversals , essential
  4. Traversals with a stack or a queue , essential

Search trees

  1. Binary search trees , essential
  2. Deleting from a binary search tree
  1. AVL trees and rotations , essential
  2. 2-3 trees
  3. Red–black trees
  4. B-trees
  5. B+ trees

Heaps

  1. Binary heaps , essential
  2. Heapsort , essential
  3. d-ary heaps

Tries and radix trees

  1. Tries
  2. Radix trees

Segment trees and Fenwick trees

  1. Prefix sums
  2. Segment trees
  3. Fenwick trees

Sorting and hashing

Sorting

  1. Bubble sort , essential
  2. Insertion sort , essential
  3. Selection sort
  4. Shell sort
  1. Merge sort , essential
  2. Quicksort , essential
  3. Counting sort
  4. Bucket sort
  5. Radix sort

Hashing

  1. Hash functions , essential
  2. Hash tables with chaining , essential
  3. Linear probing , essential
  4. Quadratic probing
  5. Double hashing
  6. Growing a hash table

Graphs

Members: Free account

Graphs

  1. Graphs and how to store them , essential
  2. Breadth-first search , essential
  1. Depth-first search , essential
  2. Topological order
  3. Dijkstra's algorithm , essential
  1. Prim's algorithm , essential
  2. Union–find , essential
  3. Kruskal's algorithm , essential

Further structures and analysis

Caches and filters

  1. LRU caches
  2. Bloom filters

Asymptotic analysis

  1. Asymptotic notation
  2. Recurrences

No lesson matches. Try a shorter word, or show all lessons.

Phasorium

Account

Sign inWith Google, GitHub or your email

Subjects

Signal processing
Linear algebra
Probability and statistics
Machine learning
Data structures

Site

Look