find a subsequence of a given sequence with the greatest sum

max_val_contig_subsequence.py

test = [5, -6, 7, 12, -3, 0, -11, -6]

def get_max_contiguous_sum(array):
	results = []
	previous_element = 0
	for element in array:
		previous_element = max(element, previous_element + element)
		results.append(previous_element)

	return max(results)

print("max contiguous array sum: " + str(get_max_contiguous_sum(test)))

def get_max_contiguous_array(array):
	current_array = [array[0]]
	result_array = [array[0]]

	#skip the first element
	for element in array[1:]:
		if (sum(current_array) + element < element):
			current_array = [element]
		else:
			current_array.append(element)

		if (sum(current_array) > sum(result_array)):
			result_array = list(current_array)

	return result_array

print("max contiguous array: " + str(get_max_contiguous_array(test)))