HowToCodePage

Algorithms

Searching, sorting and complexity analysis.

💡
This course has 3 lessons. Start with the first one and use the next / previous links at the bottom of each lesson — the sidebar keeps the whole course in order.

Lessons

  1. Complexity and Big-O in practiceReading growth rates off real loops, measuring instead of guessing, and knowing where Big-O stops predicting runtime.
  2. Sorting and searchingWhich comparison sort to reach for, why stability matters, and binary search written so it cannot loop forever.
  3. Graph algorithms: BFS, DFS and shortest pathsRepresenting a graph, traversing it breadth-first or depth-first, and choosing between Dijkstra, Bellman-Ford and A*.

More in Computer Science Fundamentals

Data Structures Computer Networks Operating Systems Character Encodings Hashing & Checksums Data Formats Dates & Time Regular Expressions

Last refreshed 2026-09-17.