01Algorithm Analysis
Algorithm Selection Guide
Comprehensive guide for choosing the right algorithm based on problem constraints, data characteristics, and performance requirements.
Learn
Study guides
and flashcards.
Cheat sheets and flashcard decks for algorithms and computer science.
Study progress is saved on this device.
Cheat sheets
Open sheet : Algorithm Selection Guide
02Algorithm Analysis
Big O Analysis Master Sheet
Complete reference for asymptotic notation, complexity analysis techniques, and time/space complexity bounds for algorithms and data structures.
03Algorithm Analysis
Complexity Analysis Reference
Essential reference for algorithm complexity analysis including time and space complexity, best/worst/average cases, and practical analysis techniques.
04Algorithm Analysis
Dynamic Programming Patterns
Comprehensive guide to dynamic programming patterns including memoization, tabulation, common problems, and optimization techniques.
05Algorithm Analysis
Graph Algorithms Reference
Comprehensive reference for graph algorithms including BFS, DFS, shortest paths, minimum spanning trees, and topological sorting with implementation details.
06Algorithm Analysis
Master Theorem Guide
Complete reference for applying the Master Theorem to solve divide-and-conquer recurrence relations with detailed examples and case analysis.
Flashcards
0133 cards
Algorithm Analysis Introduction
Master fundamental concepts of algorithm analysis including Big O notation, recurrence relations, Master Theorem, and amortized analysis.
0235 cards
Backtracking
Master backtracking algorithms including N-Queens, sudoku solving, subset generation, and constraint satisfaction problems.
0340 cards
Branch and Bound
Master branch and bound optimization techniques including traveling salesman, knapsack problems, and bound computation strategies.
0453 cards
Computational Complexity - Searching
Master searching algorithm complexities including linear search, binary search, hash table operations, and search optimization techniques.
0544 cards
Computational Complexity - Sorting
Master sorting algorithm complexities including comparison-based sorts, counting sort, radix sort, and lower bound analysis.
0682 cards
Divide and Conquer
Master divide and conquer algorithms including merge sort, quick sort, binary search, and advanced techniques like Strassen's matrix multiplication.
0737 cards
Dynamic Programming
Master dynamic programming techniques including memoization, tabulation, optimal substructure, and classic DP problems.
0852 cards
Genetic Algorithms
Master genetic algorithm concepts including selection, crossover, mutation, and evolutionary optimization techniques.
0951 cards
Graph Algorithms
Master fundamental graph algorithms including BFS, DFS, shortest paths, minimum spanning trees, and topological sorting.
1037 cards
Greedy Algorithms
Master greedy algorithm strategies including activity selection, fractional knapsack, Huffman coding, and minimum spanning trees.
1115 cards
Mathematical Examples
Master mathematical foundations for algorithm analysis including summations, recurrence relations, and asymptotic notation examples.
1248 cards
NP-Completeness
Master computational complexity theory including P vs NP, NP-completeness, polynomial reductions, and classic NP-complete problems.
1349 cards
String Algorithms
Master essential string algorithms including pattern matching, substring search, and string processing techniques.
Let’s connect
Useful AI starts with
a real problem.
Based in Michigan. Connect about agentic AI, software engineering, and the people using what we build.