Algorimths
Still under HEAVY construction
Links about Algorithms
Permutations There are n! permutations for ‘n’ elements (where n! = n * (n-1) * (n-2) * … * 2 * 1)
Permutations have a O(n!) time complexity !!!
For “anagrams” problems, permutations are the base for a dictionary search (if anagrams have to be meaningful…).
factorial
https://stackoverflow.com/questions/5136447/function-for-factorial-in-python
Heap vs Binary Search Tree (BST)
https://stackoverflow.com/questions/6147242/heap-vs-binary-search-tree-bst/29548834#29548834
Solutions to Algorithms 4th edi.
https://www.google.es/search?q=algorithms+4th+edition+solutions&ie=utf-8&oe=utf-8&client=firefox-b&gfe_rd=cr&ei=lFN8Wc7uGsSIwgKF6rvICA
http://www.chegg.com/homework-help/algorithms-4th-edition-chapter-1.4-solutions-9780321573513
https://github.com/patriques82/algorithms-solutions/blob/master/src/_1_fundamentals/_4_analysis_of_algorithms/Ex_1_4_1.md