Update assignment1.py

Author: Arun Kirubarajan

assignment1.py

@@ -5,42 +5,49 @@
 # Pro tip: think long and hard about testing your code.
 # In this assignment, we aren't giving you example function calls.
 
+
 def my_sort(lst):
  ''' Return a sorted copy of a list. Do not modify the original list. Do
  not use Python's built in sorted method or [].sort(). You may use
  any sorting algorithm of your choice.
  '''
  pass
 
+
 def sort_dict(d):
  ''' Sort a dictionary by value. The function should return
  (not print) a list of key, value tuples, in the form (key, value).
  '''
  pass 
 
+
 def prefixes(seq):
  ''' Create a generator that yields all the prefixes of a 
  given sequence. Extra credit will be rewarded for doing this 
  in a single line.
  '''
  pass
 
+
 def suffixes(seq):
  ''' Create a generator that yields all the suffixes of a 
  given sequence. Extra credit will be rewarded for doing this 
  in a single line.
  '''
  pass
 
+
 def slices(seq):
  ''' Create a generator that yields all the slices of a 
  given sequence. Extra credit will be rewarded for doing this
  in a single line.
  '''
  pass
 
+
 # HALF WAY POINT! Wahoo!
 
+
 def extract_and_apply(l, p, f):
  '''
  Implement the function below in a single line:
@@ -56,6 +63,7 @@ def extract_and_apply(l, p, f):
  '''
  pass
 
+
 def my_reduce(function, l, initializer=None):
  '''Apply function of two arguments cumulatively to the items of list l, from left to right,
  so as to reduce l to a single value. This is equivalent to the 'fold' function from CIS 120.
@@ -67,6 +75,7 @@ def my_reduce(function, l, initializer=None):
  '''
  pass
 
+
 class BSTree(object):
  ''' Implement a binary search tree.
  See here: http://en.wikipedia.org/wiki/Binary_search_tree