Assignment -1 (28 July 2015)

The objective of this assignment is to appreciate the notion of time complexity and easy vs hard problems

Implement functions n, n^2, n^3, 2^n with logic using simple loop structures and find the maximum size of n for which the result can be computed within 1 sec of system time.