From 93ea7fe5957b62f18e8fbd17a21696bd7de6332d Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Sun, 9 Feb 2020 15:16:26 -0500
Subject: Organized everything, update README

---
 collatz.c | 31 -------------------------------
 1 file changed, 31 deletions(-)
 delete mode 100644 collatz.c

(limited to 'collatz.c')

diff --git a/collatz.c b/collatz.c
deleted file mode 100644
index ec77af6..0000000
--- a/collatz.c
+++ /dev/null
@@ -1,31 +0,0 @@
-#include <stdlib.h>
-#include <stdio.h>
-#include <math.h>
-// In C, it's immediately obvious my python solution is inefficient
-
-// For keeping track of the length of sequences
-// c is a temporary counter, s changes when c reaches a new maximum
-long int c = 0;
-long int s = 0;
-long int collatz(long int seed){
-    c++;
-    if(seed == 1)
-        return 0;
-    if(seed % 2 == 0)
-        seed = seed / 2;
-    else
-        seed = 3 * seed + 1;
-    collatz(seed);
-}
-
-int main(){
-    for(long int i = 1; i < pow(10, 6); i++){
-        c = 0;
-        collatz(i);
-        if(c > s){
-            s = c;
-        }
-    }
-    printf("The longest sequence has %d numbers \n", s);
-    return 0;
-}
-- 
cgit v1.2.3