Lecture Notes on 26 Oct 2012

def max (a):
  max = a[0]
  for elt in a:
    if (elt > max):
      max = elt
  return max

def min (a):
  min = a[0]
  for elt in a:
    if (elt < min):
      min = elt
  return min

def range_num (a):
  max = a[0]
  min = a[0]
  for elt in a:
    if (elt > max):
      max = elt
    if (elt < min):
      min = elt
  return (max - min)

def find (a, x):
  idx = []
  for i in range (len(a)):
    if (x == a[i]):
      idx.append (i)
  return idx

def remove_duplicates (a):
  b = []
  for elt in a:
    if (elt not in b):
      b.append(elt)
  return b
 
def is_sorted (a):
  for i in range (1, len(a)):
    if (a[i - 1] > a[i]):
      return False
  return True