CSC645 Visualizer
★★★
Must Master
Complexity Analysis
Big-O, Big-Omega, Big-Theta
Complexity from Loops & Summations
Recurrence Relations & Master Theorem
Brute Force
Brute Force — Definition & Examples
TSP — Exhaustive Search
Assignment Problem — Exhaustive Search
Divide & Conquer
Divide & Conquer — Definition & Examples
Merge Sort
Quick Sort
Closest Pair — Brute Force vs D&C
Greedy Algorithms
Greedy Algorithms — Definition & Examples
Coin Change — Greedy Approach
Huffman Coding
Dynamic Programming
Dynamic Programming — Definition & Examples
0/1 Knapsack — DP Solution
Coin Change — DP Solution
Searching Algorithms
Linear Search
Binary Search
Bubble Sort
★★
Very Important
Graph Algorithms
Prim's Algorithm
Kruskal's Algorithm
Dijkstra's Algorithm
Floyd-Warshall Algorithm
Warshall's Transitive Closure
★
Useful Extras
BFS & DFS Graph Traversal
Binary Tree Traversals
Number Theory
Euclid's GCD Algorithm
Primality Checking
Algorithm Analysis
Empirical vs Theoretical Analysis
Data Structures Impact on Performance
@adhaghani on IG & Threads
Toggle Sidebar
Toggle theme
Home
Huffman Coding
Huffman Coding
★★★ Must Master
O(n log n)
Notes
Visualization
Analysis