Page History

def fakultet(n):
    if n == 0:
        return 1
    else:
        return n * fakultet(n - 1)

def fib(n):
    if n == 0:
        return 0
    elif n == 1:
        return 1
    else:
        return fib(n-1) + fib(n-2)

def pascal(n):
    if n == 1:
        return [1]
    else:
        linje = [1]
        forrige_linje = pascal(n-1)
        for i in range(len(forrige_linje)-1):
            line.append(forrige_linje[i] + forrige_linje[i+1])
        linje += [1]
    return linje

def palindromTest(S):
  if len(N) == 1 or len(N) == 0:
    return True
  else:
    if N[0] == N[-1] and palindromTest(N[1:-1]):
      return True
    else:
      return False

def minElement(L,n):
  if n == 1:
    return L[0]
  else:
    min = minElement(L[1:],n-1)
    if L[0] < min:
      return L[0]
    else
      return min

def maxElement(L):
  if len(L) == 1:
    return L[0]
  else:
    max = maxElement(L[1:])
    if L[0] > max:
      return L[0]
    else
      return max

def power(x, n): 
 if n < 1:
     return 1
return power(x, n-1)