Merge pull request prabhupant#191 from robbyrenz/math-pep8-correction

prabhupant · web-flow · commit 683fd0e6e4da · 2019-10-17T21:57:24.000+05:30
fix PEP 8 issues
diff --git a/algorithms/math/fibonacci_number.py b/algorithms/math/fibonacci_number.py
@@ -1,23 +1,26 @@
+# Program that prints out the fibonacci sequence until a given number
+
 def calc_fib(num):
-    while len(fib)<=num:
+    while len(fib) <= num:
         n = len(fib)
-        fib.append((fib[n-1]+fib[n-2]))
+        fib.append((fib[n-1] + fib[n-2]))
         
 def main():
     print("Enter the Position of the Number in the Sequence or \'0\' to Quit: ")
     num = 0
     fib = list()
     fib.append(0)
     fib.append(1)
+
     while True:
         num = int(input())
-        if(num<=0):
+        if(num <= 0):
             break
 
-        if len(fib)<=num:
+        if len(fib) <= num:
             calc_fib(num)
 
-        print('Fibonacci Number at Position '+str(num)+' is: '+str(fib[num]))
+        print('Fibonacci Number at Position ' + str(num) + ' is: ' + str(fib[num]))
         
 if __name__ == '__main__':
     main()
diff --git a/algorithms/math/greatest_common_divisor.py b/algorithms/math/greatest_common_divisor.py
@@ -7,23 +7,23 @@
 """
 # Iterative Solution
 def gcd(x, y):
-	if x==0:
+	if x == 0:
 		return y
-	if y==0:
+	if y == 0:
 		return x
 	
-	while x%y != 0:
-		rem = x%y;
+	while x % y != 0:
+		rem = x % y;
 		x = y
 		y = rem
 
 	return y
 
 # Recursive Solution
 def gcd(x, y):
-	if x==0:
+	if x == 0:
 		return y
-	if y==0:
+	if y == 0:
 		return x
 	
-	return gcd(y, x%y)
+	return gcd(y, x % y)
diff --git a/algorithms/math/prime.py b/algorithms/math/prime.py
@@ -1,16 +1,16 @@
 def prime(limit):
     
     count = 1
-    while(count<limit):
+    while (count < limit):
 
         flag = 0
-        for i in range(3,count,2):
-            if (count%i==0):
+        for i in range(3, count, 2):
+            if (count % i == 0):
                 flag = 1
 
-        if (flag==0):
+        if (flag == 0):
             print(count)
             
-        count+=2
+        count += 2
 
 prime(100)
