Merge branch 'master' of github.com:cs107e/mango-staff

commit 236952458a4ffbdc39f67ef9ce4ec9f4d1748541
Author: Chris Gregg <[email protected]>
Date:   Fri Jan 10 09:48:16 2025 -0800

    Merge branch 'master' of github.com:cs107e/mango-staff

Author: tofergregg

lectures/Assembly/code/fibonacci/fibonacci.c

@@ -0,0 +1,16 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+int main() {
+    int n = 10; // number of fibonacci terms
+    int f0 = 0; // fibonacci number (1st term)
+    int f1 = 1; // fibonacci number (2nd term)
+    while (n > 0) {
+        printf("%d\n", f0); // print the current term
+        int nth = f0 + f1; // the nth term
+        f0 = f1;  // update first
+        f1 = nth; // update second
+        n--; // decrement number of terms left
+    }
+    return 0;
+}

lectures/Assembly/code/fibonacci/fibonacci.py

@@ -0,0 +1,9 @@
+n = 10 # number of fibonacci terms
+f0 = 0 # fibonacci number (1st term)
+f1 = 1 # fibonacci number (2nd term)
+while n > 0:
+    print(f0) # print the current term
+    nth = f0 + f1 # the nth term
+    f0 = f1  # update first
+    f1 = nth # update second
+    n -= 1; # decrement number of terms left

lectures/Assembly/code/fibonacci/fibonacci.s

@@ -0,0 +1,16 @@
+fibonacci:
+    addi    a0, zero, 10 # number of terms we want
+    addi    a1, zero, 0  # fibonacci number (1st term)
+    addi    a2, zero, 1  # fibonacci number (2nd term)
+# now, a1 holds fibonacci_0 and
+#      a2 holds fibonacci_1
+# Now calculate the rest of the terms, which will
+# go into a1 and a2 as the algorithm continues
+# After 10 iterations, a1 should hold 55 and a2 should hold 89
+fib_loop:    
+    add     a3, a1, a2 # nth term
+    addi    a1, a2, 0  # update first
+    addi    a2, a3, 0  # update second
+    addi    a0, a0, -1  # decrement number of terms left
+    bgt     a0, zero, fib_loop # branch if not finished
+

lectures/Assembly/slides.pdf

@@ -0,0 +1,7 @@
+li a0, 67 # 0x43 or 0b01000111
+li a1, 0
+loop:
+    andi a2, a0, 1
+    add a1, a1, a2
+    srli a0, a0, 1
+    bne a0, x0, loop