# Loops - http://beastie.cs.ua.edu/cs150/book/index_14.html

i = 0
while i < 5:
  print i
  i += 1

# Other loops
for i in range(0, 5, 1): # 5 exclusive
  print i

# The counting pattern
count = 0
for i in range(0, len(items), 1):
  count += 1

# The filtered-count pattern
count = 0
for i in range(0, len(items), 1):
  if items[i] % 2 == 0:
    count += 1

# The accumulate pattern
total = 0
for i in range(0, len(items), 1):
  total += items[i]

# The filtered-accumulate pattern
def sumEvens(items):
  total = 0
  for i in range(0, len(items), 1):
    if items[i] % 2 == 0:
      total += items[i]
  return total

# The search pattern
def find(target, items): # is target in items?
  return occurrences(target, items) > 0

def occurrences(target, items):
  count = 0
  for i in range(0, len(items), 1):
    if items[i] == target:
      count += 1
  return count

## search with short-circuit
def find(target, items):
  for i in range(0, len(items), 1):
    if items[i] == target:
      return True
  return False

# The extreme pattern
largest = items[0]
for i in range(1, len(items), 1): # start comparing at index 1
  if items[i] > largest:
    largest = items[i]

# The filter pattern
def extractEvens(items):
  for i in range(0, len(items), 1):
    if isEven(items[i]):
      evens = evens + [items[i]] # array concatenation
  return evens

## Add isEven function 
def isEven(value):