O(log n)
O(n log n)
O(n^2)
O(1)
O(2^n)
O(n)

a = 0
for i in range(n):
    a = a + i()

n = 20
for i in range(n):
    for j in range(n):
        print(i, j)

nums = [4, 8, 1, 6, 10]
for i in range(len(nums)):
    for j in range(10):
        print(nums[i])

n = 128
while (n > 1):
    print(n)
    n /= 2

nums = [10, 9, 1, 10, 6, 0, 1, 1, 8, 5]
for i in range(len(nums)):
    print(nums[i])

for j in range(len(nums)):
    if (nums[j] % 2 == 0):
        print(nums[j])

def max(a, b, c):
    if (a >= b) and (a >= c):
        return a
    elif (b >= a) && (b >= c):
        return b
    else:
        return c

def exponent(base, n):
    i = 1
    result = 1
    while (i < abs(n)):
        result *= base
        i += 1

    if (n < 0):
        return 1.0 / result
    else:
        return result

def sqrt(num):
    ans = 10;
    if (num == 0):
        return 0

    for i in range(100):
        ans = 0.5 * (num / ans + ans)

    return ans