Skip to content

Instantly share code, notes, and snippets.

@brandonlee503
brandonlee503 / CS 325 HW 1 Problem 3
Created October 3, 2015 21:25
CS 325 Algorithms HW 1 Problem 3
def func3(arr):
maxSum = 0
currentSum = 0
for i in arr:
if currentSum + i > 0:
currentSum = currentSum + i
else:
currentSum = 0
if currentSum > maxSum:
@brandonlee503
brandonlee503 / CS 325 HW 1 Problem 1
Created October 3, 2015 21:11
CS 325 Algorithms - HW 1 Problem #1
def maxSubArray(arr):
maxSum = 0
# try all subarray lengths
for j in range(0, len(arr)):
# try all subarray locations
for i in range(0, len(arr) - j):
currentSum = 0
# sum subarray currentSum = sum(arr[i : i + j])
for derp in range(arr[i], arr[i+j]):
currentSum += derp