Services & Resources / Wolfram Forums / MathGroup Archive
-----

MathGroup Archive 2012

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Find a maxlist of within subsets

  • To: mathgroup at smc.vnet.net
  • Subject: [mg127893] Re: Find a maxlist of within subsets
  • From: Bob Hanlon <hanlonr357 at gmail.com>
  • Date: Thu, 30 Aug 2012 04:10:07 -0400 (EDT)
  • Delivered-to: l-mathgroup@mail-archive0.wolfram.com
  • Delivered-to: l-mathgroup@wolfram.com
  • Delivered-to: mathgroup-newout@smc.vnet.net
  • Delivered-to: mathgroup-newsend@smc.vnet.net
  • References: <20120829051345.3228C6863@smc.vnet.net>

data = {60, 67, 65, 64, 69, 69, 62};

{data[[1]], Cases[Partition[data, 3, 1],
   x_ /; (x[[2]] >= x[[1]] && x[[2]] >= x[[3]]) :>
    x[[2]]], data[[-1]]} // Flatten

{60, 67, 69, 69, 62}


Bob Hanlon


On Wed, Aug 29, 2012 at 1:13 AM, Kate <katesekula at gmail.com> wrote:
> Hi all,
>
> Given a list [a,b,c,d,e,f,g], I am trying to find the maxlist for overlapping subsets of 3 [{abc},{bcd},{cde},{def},{efg}].  To make things more difficult, this list needs to always retain the first and last member of the list [{a},{abc},{bcd},{cde},{def},{efg},{g}].  And, finally, I only want to know if the middle variable of each subset is equal to or greater than the other variables in the subset.
>
> So, for the list [60,67,65,64,69,69,62], which would then be broken into the subsets [{60},{60,67,65},{67,65,64},{65,64,69},{64,69,69},{69,69,62},{62}] I want to return the value: [60, 67, 69, 69, 62].
>
> Any thoughts on the code I could use?
>



  • Prev by Date: Re: How to create links or bookmarks to jump to sections inside a notebook
  • Next by Date: What is this shorthand notation?
  • Previous by thread: Find a maxlist of within subsets
  • Next by thread: Re: Find a maxlist of within subsets