-1) Print forever


0) Count(N) -> print 1, 2, 3, 4, ... N


1) Make a function that computes the factorial of n.
	fac(3) = 6     // 3*2*1
	fac(5) = 120   // 5*4*3*2*1


2) Make a method that prints n spaces and then a '*'.
	stars(3) -> "   *"
	stars(7) -> "       *"

3) Make a method that computes A to the Bth power
	power(3,5)   -> 243
	power(2,3)   -> 8
	power(0,1)   -> 0
	power(0,0)   -> anything you want


5) Make a method that computes the remainder of A divided by B
	remainder(17,3) -> 2 
	remainder(17,13) -> 5
	remainder(3,33) -> 0

6) Factorial
	fac(1) = 1
	fac(2) = 2*1 = 2
	fac(3) = 3*2*1 = 6
	fac(4) = 4*3*2*1 = 24

7) FindMax
	findMax(data, 10) -> biggest element among the first ten in data

8) Contains
	contains(data, target, 10) -> is there a 'target' in the first 10 items data

9) Multiply 
	mul(3,5) = 15
	mul(7,3) = 21

10) Djikstra's GCD algorithm
	gcd(a, b) -> a if a==b
	gcd(a, b) -> gcd(a-b, a) if a > b

11) Binary Search

12) Printing an array

13) IsPalindrome

14) PrintBackwards


4) Make a method that returns a string backwards
	backwards("Hello") -> "olleH"
	backwards("") -> ""
	Hint:  You can remove the last letter from a string with 
		names.Remove(names.Length - 1, 1)
	Hint:  You can get any given letter from a string with
		names.charAt(5)