#algorithms
Posts tagged with “algorithms”.
12 posts
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.
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.
Data Structures Every Developer Should Know
A practical tour of the data structures you actually use: arrays, hash maps, sets, stacks, queues, trees, heaps and graphs, with real trade-offs.
Dynamic Programming Basics: From Recursion to Tables
Dynamic programming solves problems by caching overlapping subproblems. Learn memoisation, tabulation, and how to spot a DP problem in the wild.
Hash Tables Explained: How O(1) Lookup Really Works
Hash tables turn keys into array indexes with a hash function. Learn how they work, how collisions are handled, and why lookups are O(1) on average.
Linked Lists Explained: When They Beat Arrays
Linked lists store elements in nodes connected by pointers. Learn singly and doubly linked lists, their real costs, and when they actually beat arrays.
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.
Stacks and Queues Explained With Real Use Cases
Stacks are last-in-first-out and queues are first-in-first-out. Learn how both work, how to implement them, and where each appears in real software.
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.
Trees and Graphs Explained: Traversal and Real Uses
Trees model hierarchy and graphs model relationships. Learn the structures, the traversal algorithms, and where each appears in real software.
Understanding Recursion With Practical Examples
How recursion actually works, when it beats a loop, how the call stack behaves, and the mistakes that turn a simple function into a crash.
Procedural Generation: Techniques and Trade-offs
A practical survey of procedural generation: noise, BSP, cellular automata, wave function collapse, grammars, and how to keep control of the output.