Maximum sum such that no two elements are adjacent.

Newsgroups	comp.programming
Date	2013-01-24 16:24 -0800
Message-ID	<0437fd09-e678-4867-aec7-31a11db955d6@googlegroups.com> (permalink)
Subject	Maximum sum such that no two elements are adjacent.
From	billmann <willmann817@gmail.com>

Show all headers | View raw

Does anyone know an algorithm (that uses recursion only! No Loops) that can find the maximum sum of elements in an array with the constraint that you cannot choose items that are adjacent to one another. The function I am trying to write can only take in an Integer Array but we are allowed to write helper functions either outside or inside the main function that can take in anything you want.

Back to comp.programming | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

Maximum sum such that no two elements are adjacent. billmann <willmann817@gmail.com> - 2013-01-24 16:24 -0800
  Re: Maximum sum such that no two elements are adjacent. Robert Wessel <robertwessel2@yahoo.com> - 2013-01-24 19:07 -0600
    Re: Maximum sum such that no two elements are adjacent. billmann <willmann817@gmail.com> - 2013-01-24 18:28 -0800
      Re: Maximum sum such that no two elements are adjacent. Robert Wessel <robertwessel2@yahoo.com> - 2013-01-25 00:18 -0600
        Re: Maximum sum such that no two elements are adjacent. Jussi Piitulainen <jpiitula@ling.helsinki.fi> - 2013-01-25 11:01 +0200
          Re: Maximum sum such that no two elements are adjacent. Robert Wessel <robertwessel2@yahoo.com> - 2013-01-25 05:13 -0600
            Re: Maximum sum such that no two elements are adjacent. Jussi Piitulainen <jpiitula@ling.helsinki.fi> - 2013-01-25 14:55 +0200
              Re: Maximum sum such that no two elements are adjacent. Willem <willem@turtle.stack.nl> - 2013-01-25 15:02 +0000
                Re: Maximum sum such that no two elements are adjacent. Jussi Piitulainen <jpiitula@ling.helsinki.fi> - 2013-01-25 23:41 +0200
                Re: Maximum sum such that no two elements are adjacent. Jussi Piitulainen <jpiitula@ling.helsinki.fi> - 2013-01-26 14:57 +0200
            Re: Maximum sum such that no two elements are adjacent. Tim Rentsch <txr@alumni.caltech.edu> - 2013-01-26 08:56 -0800

csiph-web