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…).


Heap vs Binary Search Tree (BST)

Solutions to Algorithms 4th edi.