MathGroup Archive 2004

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

Search the Archive

Re: number of switches


Hi,

SwitchCount[lst_] := Length[Partition[lst, 2, 1] /. {a_, a_} :>
Sequence[]]

SwitchCount /@ {{1, 1, 0, 1}, {1, 1, 0, 0}, {1, 0, 1, 0, 1}}

Regards
  Jens

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)?


  • Prev by Date: Contour lines with individual labels
  • Next by Date: Number to Binary
  • Previous by thread: Re: number of switches
  • Next by thread: Re: number of switches