#big-o
Posts tagged with “big-o”.
4 posts
01
Big-O Notation Explained With Real Code Examples
Big-O notation describes how an algorithm's cost grows as input grows. Learn the common classes, how to read them, and the mistakes beginners make.
02
Binary Search Explained: Halving Your Way to O(log n)
Binary search finds a value in a sorted array by halving the search space each step. Learn the algorithm, the off-by-one traps, and real variants.
03
Sorting Algorithms Compared: Which One and Why
Compare bubble, insertion, merge, quick, heap and counting sort on time, space and stability, and learn which one your language actually uses.
04
Time vs Space Complexity: The Trade-Off Explained
Almost every performance decision trades time for memory. Learn how to reason about the trade-off, when each side wins, and how to measure it.