Haskell Quiz/Maximum Sub-Array
From HaskellWiki
< Haskell Quiz(Difference between revisions)
| Line 11: | Line 11: | ||
* [[Haskell Quiz/Maximum Sub-Array/Solution Kristof|Kristof Bastiaensen]] | * [[Haskell Quiz/Maximum Sub-Array/Solution Kristof|Kristof Bastiaensen]] | ||
* [[Haskell Quiz/Maximum Sub-Array/Solution Ninju|Alex Watt]] | * [[Haskell Quiz/Maximum Sub-Array/Solution Ninju|Alex Watt]] | ||
| - | * [[Haskell Quiz/Maximum Sub-Array/Solution Jkramar| | + | * [[Haskell Quiz/Maximum Sub-Array/Solution Jkramar|Jkramar]] |
Current revision
Given a list of integers, the aim of this quiz is to find the sublist (sub-array in Ruby) with the maximum sum.
