Hasty
.dev
In-depth performance optimization tips for JavaScript
53 posts
Recursion 2 months ago
Recursion - The Art of Self-Reference
Understand recursion — how functions calling themselves can solve complex problems elegantly. Learn base cases, the call stack, memoization, and when iteration wins instead.
Searching 2 months ago
Exponential Search - Finding the Range First
Understand exponential search — an O(log n) algorithm that first locates the range where a target lies by doubling bounds, then narrows it with binary search. Ideal for unbounded arrays.
Searching 3 months ago
Interpolation Search - The Intelligent Guesser
Discover interpolation search — a smart O(log log n) algorithm that estimates where the target is based on value distribution, like a human searching a phone book.
Data Structures 3 months ago
Hash Tables - O(1) Lookup by Magic Hashing
Master hash tables — the data structure behind JavaScript's Map and Object. Learn how hashing enables O(1) average-case insert, delete, and lookup, and how collisions are handled.
Searching 3 months ago
Depth-First Search - Going Deep Before Wide
Master DFS — the graph traversal algorithm that explores as far as possible before backtracking. Essential for cycle detection, topological sorting, and maze solving.
Data Structures 3 months ago
Queue - The First-In, First-Out Data Structure
Understand the queue — a fundamental FIFO data structure with O(1) enqueue and dequeue. From BFS traversal to job scheduling, queues keep order fair.
Searching 3 months ago
Breadth-First Search - Exploring Layer by Layer
Learn BFS — the graph traversal algorithm that explores all neighbors at the current depth before moving deeper. Essential for shortest paths and level-order traversal.
Data Structures 3 months ago
Linked Lists - Chains of Connected Nodes
Understand linked lists — the dynamic data structure where each element points to the next. Learn singly vs doubly linked lists, their trade-offs, and when to use them over arrays.
Searching 4 months ago
Jump Search - The Block Hopping Algorithm
Explore jump search — a clever O(√n) searching algorithm that jumps through sorted arrays in blocks before doing a linear scan within the target block.
Data Structures 4 months ago
Stack - The Last-In, First-Out Data Structure
Master the stack — a fundamental LIFO data structure with O(1) push and pop. From function call stacks to undo history, stacks are everywhere in computing.
Searching 4 months ago
Linear Search - The Sequential Scan Algorithm
Understand linear search — the simplest O(n) algorithm that checks every element until it finds the target. When is it actually the right choice?
Searching 4 months ago
Binary Search - The Efficient Halving Algorithm
Master binary search! Learn how this O(log n) algorithm finds elements in sorted arrays by repeatedly halving the search space.
