Big-O Notation
Asymptotic time and space complexity analysis
Read about Big-O NotationCluster: Topics
Four foundational CS concepts, one per page. Big-O notation with a cross-language benchmark from n=10 through n=10000, recursion with per-language max depth limits, pointers with a real GDB session and Valgrind output, concurrency with a worked deadlock walkthrough. Each topic covers the failure modes graders deduct points for on CS161, CS61B, CS50, and CMU 15-213 problem sets.
Why the Topics Cluster
A student stuck on recursion in Java is stuck on recursion in Python the next week. The concept does not change with the language. CSHH built this cluster so foundational ideas live on their own pages, decomposed with real benchmarks, real GDB sessions, and the named failure modes graders deduct points for, instead of repeated as a brief paragraph on every language and course page.
Pick a Topic
Asymptotic time and space complexity analysis
Read about Big-O NotationRecursive functions and call-stack semantics
Read about RecursionMemory addresses and indirection in C and C++
Read about PointersParallel execution, synchronization, and shared-state coordination
Read about ConcurrencyExplore Related Clusters
Six cornerstone CS subjects where these topics appear in graded coursework, from data structures through machine learning.
Browse SubjectsCheatsheets and debugging guides written by the same tutors who explain these concepts in live sessions.
Browse ResourcesNamed tutor profiles with documented diagnostic playbooks for each foundational concept.
Meet the TutorsWhen a concept page is not enough to unblock your specific homework, submit the assignment and a verified tutor will walk it through with you inside 12 hours.
Submit Your Assignment