Algorithms
How to Use This Series
Navigate this 23-part algorithms series effectively. Learn the knowledge pyramid, optimal learning cycles, and personalized paths for interview prep or production mastery.
Algorithms
Algorithm Analysis Fundamentals
Master Big O notation, Big Omega, Big Theta, and amortized analysis. Learn to derive complexity for any algorithm and use JMH for proper Java benchmarking.
Algorithms
Recursion and Iteration Mastery
Understand call stack mechanics, StackOverflowError prevention, and converting between recursive and iterative solutions. Covers memoization and trampolining patterns.
Algorithms
Divide and Conquer
Apply the Divide & Conquer paradigm to break down problems. Learn the Master Theorem for analyzing recurrences and implement classic D&C algorithms.
Algorithms
Comparison-Based Sorting
Deep dive into QuickSort, MergeSort, HeapSort, and TimSort with implementation details and practical trade-offs between these fundamental algorithms.
Algorithms
Linear Time Sorting
Escape the O(n log n) lower bound using Counting Sort, Radix Sort, and Bucket Sort when data has bounded, integer keys.
Algorithms
Sorting in Practice
Bridge theory to practice: stability, Top-K selection, external sorting, parallel sorting, and writing correct Comparators for production systems.
Algorithms
Advanced Sorting Techniques
Explore hybrid algorithms like IntroSort and TimSort, Patience Sort for nearly-sorted data, Block Sort for in-place stable sorting.
Algorithms
Binary Search Mastery
Write bug-free binary search: classic, lower bound, upper bound, and equal range variants. Learn binary search on answer for parametric problems.
Algorithms
Specialized Search Algorithms
Apply interpolation, exponential, jump, Fibonacci, and ternary search when data has special properties that outperform binary search.
Page 1 of 3