changed casing

pratikscfr · pratikscfr · commit a5b56bbf7607 · 2021-06-13T21:04:08.000+05:30
diff --git a/algorithms/dynamic_programming/partition_sum.py b/algorithms/dynamic_programming/partition_sum.py
@@ -3,18 +3,18 @@
 
 # Returns true if arr[] can be partitioned
 # in two subsets of equal sum, otherwise false
-def findPartiion(arr, n) :
-	Sum = 0
+def find_partiion(arr, n) :
+	sum = 0
 
 	# Calculate sum of all elements
 	for i in range(n) :
-		Sum += arr[i]
-	if (Sum % 2 != 0) :
+		sum += arr[i]
+	if (sum % 2 != 0) :
 		return 0
-	part = [0] * ((Sum // 2) + 1)
+	part = [0] * ((sum // 2) + 1)
 
 	# Initialize the part array as 0
-	for i in range((Sum // 2) + 1) :
+	for i in range((sum // 2) + 1) :
 		part[i] = 0
 
 	# Fill the partition table in bottom up manner
@@ -23,7 +23,7 @@ def findPartiion(arr, n) :
 		# the element to be included
 		# in the sum cannot be
 		# greater than the sum
-		for j in range(Sum // 2, arr[i] - 1, -1) :
+		for j in range(sum // 2, arr[i] - 1, -1) :
 		
 			# check if sum - arr[i]
 			# could be formed
@@ -33,14 +33,14 @@ def findPartiion(arr, n) :
 			if (part[j - arr[i]] == 1 or j == arr[i]) :
 				part[j] = 1
 
-	return part[Sum // 2]
+	return part[sum // 2]
 
 # Drive code
 arr = [ 1, 3, 3, 2, 3, 2 ]
 n = len(arr)
 
 # Function call
-if (findPartiion(arr, n) == 1) :
+if (find_partiion(arr, n) == 1) :
 	print("Can be divided into two subsets of equal sum")
 else :
 	print("Can not be divided into two subsets of equal sum")
