From 8e431d287c0e89041506da4c4da57e3e3d657d72 Mon Sep 17 00:00:00 2001
From: mjfernez <mjfernez@gmail.com>
Date: Mon, 3 Feb 2020 23:04:10 -0500
Subject: cleanup, added c translations for some

---
 collatz.py | 38 +++++++++++++++++++++-----------------
 1 file changed, 21 insertions(+), 17 deletions(-)

(limited to 'collatz.py')

diff --git a/collatz.py b/collatz.py
index 404a2ed..74d5e1e 100644
--- a/collatz.py
+++ b/collatz.py
@@ -1,24 +1,28 @@
-import PIL, math
+import PIL
+import math
 
-#Problem 14 Longest Collatz sequence
-#Note, a little slow, takes about 15 seconds. 
-#There is probably a more efficient solution out there
+# Problem 14 Longest Collatz sequence
+# Note, a little slow, takes about 15 seconds.
+# There is probably a more efficient solution out there
 chain = []
 biggo = []
 
+
 def collatz(seed):
-	chain.append(seed)
-	if(seed == 1): return 0
-	if(seed%2 == 0):
-		seed = seed/2
-	else:
-		seed = 3*seed +1
-	collatz(seed)
+    chain.append(seed)
+    if(seed == 1):
+        return 0
+    if(seed % 2 == 0):
+        seed = seed/2
+    else:
+        seed = 3*seed + 1
+    collatz(seed)
+
 
-for n in range(1,pow(10,6)):
-	collatz(n)
-	if(len(chain)>len(biggo)):
-		biggo = chain
-	chain = []
+for n in range(1, pow(10, 6)):
+    collatz(n)
+    if(len(chain) > len(biggo)):
+        biggo = chain
+    chain = []
 print(biggo)
-print("Has " + str(len(biggo)) +" numbers.")
+print("Has " + str(len(biggo)) + " numbers.")
-- 
cgit v1.2.3