We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 24b9663 + 3426f32 commit 16fda79Copy full SHA for 16fda79
1 file changed
Arrays/Kadane's_Algorithm.py
@@ -0,0 +1,17 @@
1
+#Kadane's Algorithm
2
+
3
+def kadaneAlgo(n,arr):
4
+ sum_num = 0
5
+ max_sum = 0
6
+ for i in range(n):
7
+ sum_num += arr[i]; #maximum ending here
8
+ if arr[i] > sum_num:
9
+ sum_num = arr[i]
10
+ if max_sum < sum_num: #comparing maximum ending here , maximum so far
11
+ max_sum = sum_num
12
+ return max_sum
13
14
+n = int(input())
15
+l = [int(x) for x in input().split()]
16
+max_sm = kadaneAlgo(n,l)
17
+print(max_sm)
0 commit comments