Maximum Segment Sum, Monadically (distilled tutorial, with solutions)

The maximum segment sum problem is to compute, given a list of integers, the largest of the sums of the contiguous segments of that list. This problem specification maps directly onto a cubic-time algorithm; however, there is a very elegant linear-time solution too. The problem is a classic exercise...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Gibbons, Jeremy
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 18.11.2011
Subjects:	Algorithms Functional programming Integers
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!