Difference between revisions of "Haskell Quiz/Maximum Sub-Array"
Jump to navigation
Jump to search
| 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]] |
Latest revision as of 19:54, 19 November 2008
Given a list of integers, the aim of this quiz is to find the sublist (sub-array in Ruby) with the maximum sum.