MathGroup Archive 2004

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

Search the Archive

Re: number of switches


fake wrote:

> Consider the lists {1,1,0,1} and {1,1,0,0},{1,0,1,0,1}.
> The first sequence (1101) switches 2 times (#2digit~#3digit,
> #3digit~#4digit}, the second (1100) 1 time, the third 10101 4 times.
> 
> I have the following problem.
> Consider a list of binary digits. Which is the easiest way to count the
> number of switches of the list (using Mathematica commands)?

Does this do it?

f[{}] := 0
f[l_] := Length@Split@l - 1

I get:

In  := f[{1,1,0,1}]
Out := 2

In  := f[{1,1,0,0}]
Out := 1

In  := f[{1,0,1,0,1}]
Out := 4

As well as f[{}]=0. :)

Cheers,
Jon.


  • Prev by Date: Re: number of switches
  • Next by Date: Re: RE: Re: Is there any productive way to use Mathematica + pdfLaTeX?
  • Previous by thread: Re: number of switches
  • Next by thread: Re: number of switches