Amethyst - Elaine W.

part-1.py

@@ -5,16 +5,42 @@
 
 # factorial
 
-
+def factorial(n): 
+ if n < 0:
+ raise ValueError
+
+ if n == 0: 
+ return 1
+ else: 
+ sum = n * factorial(n-1)
+ return sum
+
 
 # reverse
 
-
+def reverse(text): 
+ if len(text) == 0: 
+ return text
+ else: 
+ reverse_text = reverse(text[1:]) + text[0]
+ return reverse_text
 
 # bunny
 
-
+def bunny(count): 
+ if count == 0: 
+ return count
+ else: 
+ return bunny(count - 1) + 2
 
 # is_nested_parens
 
-
+def is_nested_parens(parens): 
+ if not len(parens): 
+ return True
+ else: 
+ if parens[0] == "(" and parens[-1] == ")": 
+ parens = is_nested_parens(parens[1:-1])
+ return parens
+ else:
+ return False

part-2.py

@@ -5,12 +5,35 @@
 
 # search
 
-
+def search(array, query):
+ if not array: 
+ return False
+ if array[0] == query: 
+ return True
+ return search(array[1:], query)
+
 
 # is_palindrome
 
+def is_palindrome(text): 
+ if text == "":
+ return True
+ if len(text) == 1: 
+ return True
+ if text[0] == text[-1]: 
+ return is_palindrome(text[1:-1])
+ else:
+ return False
 
 
 # digit_match
 
-
+def digit_match(n1, n2): 
+ n1 = str(n1)
+ n2 = str(n2)
+
+ if n1 == "" or n2 == "": 
+ return 0
+ if n1[-1] == n2[-1]: 
+ return 1 + digit_match(n1[:-1], n2[:-1])
+ return 0 + digit_match(n1[:-1], n2[:-1])