From 51b5c4efeb77c309d3a0d4e4c4d2838fb1597282 Mon Sep 17 00:00:00 2001 From: Jayanth Date: Wed, 19 Jun 2019 17:25:38 +0530 Subject: [PATCH] removed unnessary variables and added pep8 standard --- Circle.py | 10 ++++------ factorial.py | 9 ++++++--- fibonacci.py | 9 ++++----- find_div.py | 6 +++--- gcd.py | 6 ++---- largest_num.py | 11 ++++------- lcd.py | 4 ++-- list_larg.py | 10 ++++++---- list_odd_even.py | 7 ++++--- list_sum.py | 2 +- next_prime.py | 3 ++- palindrome.py | 4 ++-- previous_prime.py | 7 ++++--- radius.py | 2 +- string_len.py | 5 ++--- text_read.py | 1 + 16 files changed, 48 insertions(+), 48 deletions(-) diff --git a/Circle.py b/Circle.py index 26a7460..3eb0e12 100644 --- a/Circle.py +++ b/Circle.py @@ -2,16 +2,14 @@ PI = 3.14 -#r*r is repesents squire and PI =3.14 +# r*r is repesents squire and PI =3.14 def area(r): - ar = PI * (r**2) - return ar + return PI * (r**2) # 2 multiply PI=3.14 multiply r -def cir(r): - cir = PI * (2 * r) - return cir +def circumference(r): + return PI * (2 * r) # Main diff --git a/factorial.py b/factorial.py index 781f48a..2393f54 100644 --- a/factorial.py +++ b/factorial.py @@ -1,12 +1,15 @@ # This program is to print factorial def factorial(num): - factor=1 + factor = 1 + for i in range(1,num+1,1): - factor*=i + factor *= i + return factor -#main + +# main if __name__ == "__main__": nums=int(input("Enter the number for factorial: ")) print("factorial of ",nums," is ",factorial(nums)) diff --git a/fibonacci.py b/fibonacci.py index ea648a1..fc91a3c 100644 --- a/fibonacci.py +++ b/fibonacci.py @@ -1,13 +1,12 @@ -#This program is to print Nth fibonacci number +# This program is to print Nth fibonacci number -t0,t1 = 0,1 - -def fibon(t0,t1): +def fibon(t0 = 0, t1 = 1): temp= t0+t1 t0=t1 t1=temp return t0,t1 + def display(num,t0,t1): i=0 list=[0,1] @@ -21,7 +20,7 @@ def display(num,t0,t1): return list -#main +# main if __name__ == "__main__": num= int(input("Enter the number: ")) list=display(num,t0,t1) diff --git a/find_div.py b/find_div.py index b7f31a5..80bd60f 100644 --- a/find_div.py +++ b/find_div.py @@ -1,6 +1,6 @@ # This is program is used to display Divisible of 7 and Note multiply of 5 -#second loading fn +# Second loading fn def div_7(num,num2): list=[] for i in range(num,num2+1,1): @@ -8,7 +8,7 @@ def div_7(num,num2): list.append(i) return list -#first loading fn +# First loading fn def mult_5(num,num2): ls=[] l= div_7(num,num2) @@ -19,7 +19,7 @@ def mult_5(num,num2): ls.append(i) return ls -#main +# Main if __name__== "__main__": num = 2000 num2 = 3200 diff --git a/gcd.py b/gcd.py index 4ebbe96..edb9d3e 100644 --- a/gcd.py +++ b/gcd.py @@ -1,13 +1,11 @@ # This program is to find the GCD(Greatest Commen Factore or Diviser) def gcd(val,val1): - while(val1): - - val, val1= val1, val%val1 + val, val1 = val1, val%val1 return val # Main if __name__ == "__main__": - print("GCD of 16,24 is",gcd(16,24)) + print("GCD of 20, 19 is",gcd(390,6777)) diff --git a/largest_num.py b/largest_num.py index c9a82d3..cb37ccb 100644 --- a/largest_num.py +++ b/largest_num.py @@ -2,14 +2,11 @@ # Function to check largest Number def largest(num1,num2,num3): - - if (num1>num2) and (num1>num3): + if num1 > num2 and num1 > num3: return num1 - - elif (num2>num3) and (num2>num1): + elif num2 > num3 and num2 > num1: return num2 - - elif (num3>num1) and (num3>num2): + elif num3 > num1 and num3 > num2: return num3 # Main @@ -17,5 +14,5 @@ def largest(num1,num2,num3): num1=(input("Enter the 1st Number")) num2=(input("Enter the 2st Number")) num3=(input("Enter the 3st Number")) - + print(largest(num1,num2,num3)) diff --git a/lcd.py b/lcd.py index f29a47a..387dbaf 100644 --- a/lcd.py +++ b/lcd.py @@ -1,9 +1,9 @@ # This program is used to display LCD of two numbers -import gcd +from gcd import gcd def lcd(num,num1): - gcd_val = gcd.gcd(num,num1) + gcd_val = gcd(num,num1) given_mul = num*num1 lcd_val = (given_mul//gcd_val) return lcd_val diff --git a/list_larg.py b/list_larg.py index 811176d..861da25 100644 --- a/list_larg.py +++ b/list_larg.py @@ -1,15 +1,17 @@ -#This program +# This program def largest(num): l = len(num) - # print(l) val=0 + for i in range(0,l,1): if val<=num[i]: val=num[i] - return val -#main + return val4 + + +# Main if __name__ =="__main__": lists = [5,11,2,3,6,4,7,8,10,9,1] print("The largest Number is the given list is ",largest(lists)) diff --git a/list_odd_even.py b/list_odd_even.py index 027ffb8..d28862d 100644 --- a/list_odd_even.py +++ b/list_odd_even.py @@ -1,18 +1,19 @@ -#This program is used to print odd first and even at last +# This program is used to print odd first and even at last def find(list): temp1=[] temp2=[] + for i in list: if i%2 == 0: temp1.append(i) - #print(temp1) else: temp2.append(i) - #print(temp2) + return temp2+temp1 + #main if __name__=="__main__": lists = [0,1,2,3,4,5,6,7,8,9,10] diff --git a/list_sum.py b/list_sum.py index 007033c..30e87a8 100644 --- a/list_sum.py +++ b/list_sum.py @@ -2,7 +2,6 @@ def sums(num): - sum1=0 sum2=0 @@ -11,6 +10,7 @@ def sums(num): sum1+=i else: sum2+=i + return sum1,sum2 #main diff --git a/next_prime.py b/next_prime.py index 04af065..e794013 100644 --- a/next_prime.py +++ b/next_prime.py @@ -1,8 +1,9 @@ #This program def nex_prime(num): - if num ==0 or num ==1: + if num == 0 or num == 1: num=1 + for i in range(num+1, (num+1)*2, 1): if prime(i): return i diff --git a/palindrome.py b/palindrome.py index 6575840..aef3170 100644 --- a/palindrome.py +++ b/palindrome.py @@ -5,9 +5,9 @@ def palindrome(str): # Main if __name__ == "__main__": - x=palindrome("mom") + user_input = palindrome("mom") - if x: + if user_input: print("is palindrome") else: print("is not palindrome") diff --git a/previous_prime.py b/previous_prime.py index 7ab5edf..ace6f0a 100644 --- a/previous_prime.py +++ b/previous_prime.py @@ -1,14 +1,14 @@ - def previous_prime(num): for i in range( num-1 , 1 , -1 ): if prime(i): return i + def prime(num): if num == 2: return True - elif num%2==0: + elif num%2 == 0: return False for i in range(3, (num//3),2): @@ -17,7 +17,8 @@ def prime(num): return True -#mani + +# mani if __name__ == "__main__": num= int(input("Enter the Number: ")) diff --git a/radius.py b/radius.py index d3439a9..78144da 100644 --- a/radius.py +++ b/radius.py @@ -6,7 +6,7 @@ # Radius Formula for Circle Radius= Area divided by PI def Radius(area): r = area/PI - Rad=math.sqrt(r) + Rad = math.sqrt(r) #rad is Radius return Rad diff --git a/string_len.py b/string_len.py index 7a32025..da33d21 100644 --- a/string_len.py +++ b/string_len.py @@ -1,8 +1,7 @@ #this program -def str_len(l): - length=len(l) - return length +def str_len(string): + return len(string) if __name__ == "__main__": diff --git a/text_read.py b/text_read.py index d7fd578..84dac87 100644 --- a/text_read.py +++ b/text_read.py @@ -12,6 +12,7 @@ def checking_line(): file.close() return count + # Main if __name__=="__main__": print(checking_line())