Snippets tagged sublist

  • Maximum Sublist Problem

    According to Wikipedia, the maximum sub-array problem is a programming task of finding the contiguous sub-array within a one-dimensional array of numbers (containing at least one positive number) which has the largest sum. The following is an attempt to solve this problem by using F# list rather than array.

    3 people like this

    Posted: 4 years ago by Joel Huang