MathGroup Archive 2009

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

Search the Archive

Re: how to get the longest ordered sub sequence of a list in

  • To: mathgroup at smc.vnet.net
  • Subject: [mg103203] Re: how to get the longest ordered sub sequence of a list in
  • From: Szabolcs Horvát <szhorvat at gmail.com>
  • Date: Thu, 10 Sep 2009 07:22:31 -0400 (EDT)
  • References: <h87pgp$5gt$1@smc.vnet.net>

On 2009.09.09. 10:37, a boy wrote:
> how to get a (strict or not-strict)decreasing sub sequence of a list?
>                                               ----------------
>
> increasing                                   ?
>

Split[lst, #1 >= #2&] returns all decresasing sequences.




  • Prev by Date: Re: Print in a loop
  • Next by Date: Margins in PDF
  • Previous by thread: Re: Re: how to get the longest ordered sub
  • Next by thread: Re: how to get the longest ordered sub sequence of a list in