Lecture Notes on 26 Jul 2013

def is_sorted (a):
  for i in range (1, len(a)):
    if (a[i-1] > a[i]):
      return False
  return True

def is_equal (a, b):
  if (len(a) != len(b)):
    return False

  for i in range (len(a)):
    if (a[i] != b[i]):
      return False

  return True

def is_anagram (a, b):
  if (len(a) != len(b)):
    return False

  a.sort()
  b.sort()

  for i in range (len(a)):
    if (a[i] != b[i]):
      return False

  return True

def does_contain (a, n):
  if (len(a) != n):
    return False

  for i in range (1, n + 1):
    if (i not in a):
      return False
  return True

  a.sort()
  if (a[0] != 1):
    return False

  for i in range (1, len(a)):
    if (a[i] - a[i-1] != 1):
      return False
   return True

def reverse_rows (a):
  b = []
  for row in range (len(a)):
    b.append (row.reverse())
  return b

def reverse_columns (a):
  b = []
  for row in range (len(a)):
    b.insert(0, row)
  return b

  b.append (a.reverse())
  return b