Adding session2 HW

Author: tzane

Students/Tyler G/session2/Ack.py

@@ -0,0 +1,26 @@
+import sys
+
+def Ack(m, n):
+    """
+    This is the Ackerman function
+    which is recursive and I don't understand
+    all that well. It returns a non-negative integer.
+    """
+    if m < 0 or n < 0:
+        return None
+    if m == 0:
+        return n + 1
+    elif m > 0 and n == 0:
+        return Ack(m-1,1)
+    elif m > 0 and n > 0:
+        return Ack(m-1,Ack(m,n-1))
+
+def main():
+    m_entry = int((sys.argv[1]))
+    n_entry = int((sys.argv[2]))
+      
+    print Ack(m_entry, n_entry)  
+
+if __name__ == "__main__":
+    main()
+

Students/Tyler G/session2/Session2_ExtraCredit.py

@@ -0,0 +1,23 @@
+
+
+#Session 2 Extra Credit  
+def FizzBuzzFrodoBilboGandalf(n):
+    for i in range(1,n+1):
+        holder = " "
+        if i % 3 == 0:
+            holder += "Fizz"
+        if i % 5 == 0:
+            holder += "Buzz"
+        if i % 7 == 0:
+            holder += "Frodo"
+        if i % 11 == 0:
+            holder += "Bilbo"
+        if i % 13 == 0:
+            holder += "Gandalf"
+        if holder == " ":
+            print i
+        else:
+            print holder.lstrip(" ")
+
+
+FizzBuzzFrodoBilboGandalf(100)

Students/Tyler G/session2/series.py

@@ -0,0 +1,40 @@
+def fibonacci(n):
+    """
+    Returns the nth value of the fibonacci sequence.
+    """
+    sequence = [0,1]
+    for i in range(n-2):
+        sequence.append(sequence[len(sequence)-2] + sequence[len(sequence)-1])
+    return sequence[n-1]
+
+def lucas(n):
+    """
+    Returns the nth value of the lucas sequence. It is
+    the same as the fibonacci series except the starting 
+    numbers are 2 and 1 instead of 0 and 1.
+    """
+    sequence = [2,1]
+    for i in range(n-2):
+        sequence.append(sequence[len(sequence)-2] + sequence[len(sequence)-1])
+    return sequence[n-1]
+
+def sum_series(n, o = 0, p = 1):
+    """
+    First parameter returns nth value of series. The second 
+    and third optional parameters allows the user to define 
+    the first two values in the fibonacci sequence.
+    """
+    sequence = [o, p]
+    for i in range(n-2):
+        sequence.append(sequence[len(sequence)-2] + sequence[len(sequence)-1])
+    return sequence[n-1]
+
+def main():
+    n_entry = int((sys.argv[1]))
+    o_entry = int((sys.argv[2]))
+    p_entry = int((sys.argv[3]))
+    
+    print sum_series(n_entry, o_entry, p_entry)  
+
+if __name__ == "__main__":
+    main()