This repo is used to collect different exercize solution of the Algorithm course. Please push you solution, both code and any kind of text file (e.g. latex, markdown, word, plain txt), in the folder corresponding to the right exercise. We will try to keep the best solution in the pdf named: "ProblemX_SOLUTION.pdf". In this file there could be more than one solution.
- EX1: Range updates. SOLVED
- EX2: Depth of a node in a random search tree.SOLVED
- EX3: Karp-Rabin fingerprinting on strings. SOLVED
- EX4: Hashing sets. SOLVED
- EX5: Family of uniform hash functions. SOLVED
- EX6: Deterministic data streaming. SOLVED
- EX7: Special case of most frequent item in a stream. SOLVED
- EX8: Count-min sketch: extension to negative counters. SOLVED
- EX9: Count-min sketch: range queries. SOLVED
- EX10: Space-efficient perfect hash SOLVED
- EX11: Bloom filters vs. space-efficient perfect hash SOLVED
- EX12: MinHash sketches SOLVED
- EX13: Randomized min-cut algorithm SOLVED
- EX14: External memory implicit hashing SOLVED
- EX15: Implicit navigation in vEB layour SOLVED
- EX16: 1-D range query SOLVED
- EX17: External memory mergesort SOLVED
- EX18: External memory (EM) permuting SOLVED
- EX19: Suffix sorting in EM SOLVED
- EX20: Wrong greedy for minimum vertex cover SOLVED
- EX21: Greedy 2-approximation for MAX-CUT on weighted graphs SOLVED
If you believe that the proposed solutions are wrong, or there are mistakes, or you have a better solution, please do not esitate to review the already existing file, or upload your solution. Actually, if you want to upload your solution, you are very welcome. Last but not least, if you modify or find any mistake, please create and issue, in order to let everyone know about that.