Haskell Quiz/Maximum Sub-Array

From HaskellWiki
< Haskell Quiz
Revision as of 19:54, 19 November 2008 by Jkramar (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search


Given a list of integers, the aim of this quiz is to find the sublist (sub-array in Ruby) with the maximum sum.

The Problem

Solutions

Retrieved from "https://wiki.haskell.org/index.php?title=Haskell_Quiz/Maximum_Sub-Array&oldid=24159"