cs1231s finals algos

Written in Source (CS1101S) NUS

Current features:

1. Find gcd of two numbers
2. Find bezout's identity of two numbers
3. Convert base 10 to desired base (support up to base 36)
4. Convert from other bases to base 10
5. Check whether an input is prime
6. Calculate multiplicative inverse of a modulo n
7. Given inorder and either preorder and postorder traversal of a tree, output the unique tree
8. Count number of functions mapping A to B, with cardinalities m and n respectively

Feel free to use and share.