Algorithms

Some notes

• Divide and conquer [pdf]

• Dynamic programming 

• Greedy

• Huffman tree [pdf]

• Graph: SSSP (Single-Source Shortest Path) [pdf]

• Graph: All-pairs shortest paths (APSP) [pdf]

• Network flow

• Number theoretic algorithms

• RSA

• Backtracking

• NPC, approximation algorithms

Appendix

• Quantum computing: Grover algorithm 

Useful links

• Visualize algorithms and DS step by step visualgo.net

• Compact team note (easy version) https://github.com/justiceHui/icpc-teamnote-for-newbie/blob/master/main.pdf : 

• Team note for ICPC https://github.com/justiceHui/icpc-teamnote/blob/master/pdf/240919-icpc-world-finals-astana.pdf 

• Visualize memory and stack frame in C, python https://pythontutor.com

• Sorting animation https://www.youtube.com/watch?v=ZZuD6iUe3Pc

• External merge sort visualization https://valeriodiste.github.io/ExternalMergeSortVisualizer/

• Euclidean algorithm https://demonstrations.wolfram.com/TheEuclideanAlgorithm/

• RSA, https://www.cryptool.org/en/cto/rsa-step-by-step

• Master theorem example code https://cs.baylor.edu/~hamerly/courses/3334_resources/master.php

• CSP demo https://stanford-cs221.github.io/autumn2019/lectures/index.html#include=inference-demo.js&example=csp