algorithm note

Algorithm: Design and Analysis Part 1

by Tim Roughgarden

(1) Divide and Conquer
(2) Randomized Selection
(3) Graphs, The Contraction Algorithm
(4) Graph Search and Connectivity
(5) Dijkstra, Heap, Red-Black Tree
(6) Hash Table, Universal Hashing, Bloom filters

Algorithms, Part 1

by Robert Sedgewick

(1) Union Find
(2) Analysis of Algorithms

Algorithms, Part 2

by Robert Sedgewick

(1) Spanning Tree, Shortest Paths
(2) Radix Sort, Suffix Sort
(3) R-way, Ternary Tries
(4) KMP, Boyer-Moore, Rabin-Karp
(5) Maximum Flow (Ford-Fulkerson)
(6) Data Compression, Huffman, LZW

Scala

• Project Euler (26 / 450)
• quick sort
• random contraction
• strongly connected components
• dijkstra shortest path
• 2-sum, median maintenance

Java

• Union Find
• LSD, MSD, Longest Repeated Substrings
• R-way, Ternary Tries

C++

data structure

• Linked list
• Double linked list
• Stack
• Heap
• Binary search tree

sorting

• Merge sort
• Quick sort
• Selection sort
• Bubble sort
• Insertion sort