fib

src/euler.c

@@ -20,7 +20,7 @@ double factorial(double i) {
 
     // someone said i need 2 for loops. Totally wrong?
     for(int j=1;j<given;j++){
-        
+
         p *= j;
         //printf("[DEBUG]p is %f, j is %d\n", p, j);
     }
@@ -35,16 +35,15 @@ int main(int argc, char *argv[]){
     int k = 0;
     int end = 0;
     while(!end){
-	res += euler(k);
+        res += euler(k);
-	printf("%f, %f\n", res, lres);
+        printf("%f, %f\n", res, lres);
-	if(res==lres)
+        if(res==lres)
-	    end = 1;
+            end = 1;
-	else { 
+        else {
-	    lres = res;
+            lres = res;
-	}
+        }
-	k++;
+        k++;
     }
     printf("calculated eulers number as %f\n", res);
     return 0;
 }
-

src/fib.c

@@ -0,0 +1,29 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <inttypes.h>
+
+const int START_VALUES[2] = {0, 1};
+const int LIMIT = 90;
+
+int main(int argc, char** argv) {
+	if (argc != 2) {
+		printf("usage: %s MAX_NUMBER\n", argv[0]);
+		exit(1);
+	}
+	int max = atoi(argv[1]);
+	if (max > LIMIT) {
+		printf("C does not provide a datatype large enough to compute fibonacci numbers > %d. (%d)\n", LIMIT, max);
+		exit(1);
+	}
+	uintmax_t* nums = malloc(max * sizeof(uintmax_t));
+	nums[0] = START_VALUES[0];
+	nums[1] = START_VALUES[1];
+
+	for(int i = 2; i < max+1; i++) {
+		nums[i] = nums[i-2] + nums[i-1];
+	}
+
+	for(int i = 0; i < max+1; i++) {
+		printf("%02d. %ju\n", i, nums[i]);
+	}
+}