All-Pairs Shortest-Paths (Floyd-Warshall Algorithm)
dynamic programming part4
The following posts contain some materials from the algorithm series (6.006, 6.046 and 6.851) at MIT.
Single-Source Shortest-Paths (Dijkstra Algorithm)
greedy strategy
Performance of the Java Collections Framework
java collections
Huffman Encoding
greedy strategy
Fractional knapsack
greedy strategy
DP vs. Greedy (the activity-selection problem)
dynamic programming part3
Dynamic Programming Part2
dynamic programming part2
Rod Cutting (DP Intro)
dynamic programming part1
AVL Search Tree
search tree
Binary Search Tree (BST)
search tree
Tree Basics & Tricks
search tree
Hashing
algorithm
Doubly Linked-List
data structure
Priority Queue (Using Max-Heap)
data structure
Stack & Queue
data structure
Bucket Sort
sorting algoritm
Radix Sort
sorting algoritm
Decision Tree
data structure
Counting Sort
sorting algoritm
Randomized Sort
sorting algorithm
Quick Sort
sorting algorithm
Heap Sort
sorting algorithm
Merge Sort
sorting algorithm
Insertion Sort
sorting algorithm