Created
April 17, 2018 21:44
-
-
Save Turupawn/f05e230aeabcde233739ec0ad914ca35 to your computer and use it in GitHub Desktop.
Algo exercices
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ##Divide and conquer | |
| * [OrderedVectorSearch](https://github.com/Turupawn/OrderedVectorSearch) | |
| * [PeakFinding](https://github.com/Turupawn/PeakFinding) | |
| * [PowerCalculation](https://github.com/Turupawn/PowerCalculation) | |
| * [MaximalSubsequence](https://github.com/Turupawn/MaximalSubsequence) | |
| ##Hash maps | |
| * [Map](https://github.com/Turupawn/Map) | |
| * [MapDelete-Exists](https://github.com/Turupawn/MapDelete-Exists) | |
| * [HashMapMiscFunctions](https://github.com/Turupawn/HashMapMiscFunctions) | |
| ##Heaps | |
| * [HeapPointers](https://github.com/Turupawn/HeapPointers) | |
| * [HeapArray](https://github.com/Turupawn/HeapArray) | |
| * [InsertOnHeap](https://github.com/Turupawn/InsertOnHeap) | |
| * [ReplaceOnHeap](https://github.com/Turupawn/ReplaceOnHeap) | |
| * [RemoveMaxFromHeap](https://github.com/Turupawn/RemoveMaxFromHeap) | |
| * [SortVector](https://github.com/Turupawn/SortVector) | |
| * [AnalisisExamen1Raton](https://github.com/Turupawn/AnalisisExamen1Raton) | |
| ##Graphs | |
| * [Find-in-Graph](https://github.com/Turupawn/Find-in-Graph) | |
| * [FindCycleInGraph](https://github.com/Turupawn/FindCycleInGraph) | |
| ##Greedy | |
| * [ActivitySelection](https://github.com/Turupawn/ActivitySelection) | |
| * Huffman codes | |
| * [DecodeHuffman](https://github.com/Turupawn/DecodeHuffman) | |
| * [GenerateHuffman](https://github.com/Turupawn/GenerateHuffman) | |
| * [GetHuffmanCodes](https://github.com/Turupawn/GetHuffmanCodes) | |
| * [SortedHuffman](https://github.com/Turupawn/SortedHuffman) | |
| * [KruskalMST](https://github.com/Turupawn/KruskalMST) | |
| ##Dynamic programming | |
| * [Fibonacci](https://github.com/Turupawn/Fibonacci) | |
| * [Change-Making](https://github.com/Turupawn/Change-Making) | |
| * [Bellman-Ford-Shortest-Path](https://github.com/Turupawn/Bellman-Ford-Shortest-Path) | |
| * [Examen2Algoritmos](https://github.com/Turupawn/Examen2Algoritmos) | |
| ##Useful Links | |
| * [Geek for geeks](http://www.geeksforgeeks.org/greedy-algorithms-set-3-huffman-coding-set-2/) | |
| * [VisuAlgo](https://visualgo.net/en) | |
| * [Siggraph's Huffman Tutorial](https://www.siggraph.org/education/materials/HyperGraph/video/mpeg/mpegfaq/huffman_tutorial.html) | |
| * [CPlusPlus forum huffman example](http://www.cplusplus.com/forum/beginner/41569/) | |
| * [Usfca's Kruskal MST](https://www.cs.usfca.edu/~galles/visualization/Kruskal.html) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment