MathGroup Archive 2004

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

Search the Archive

Re: number of switches

  • To: mathgroup at
  • Subject: [mg47542] Re: number of switches
  • From: bobhanlon at (Bob Hanlon)
  • Date: Thu, 15 Apr 2004 03:40:48 -0400 (EDT)
  • References: <c5j6vd$qqo$>
  • Sender: owner-wri-mathgroup at

nbrSwitches[x_?VectorQ] := 
    Length[x //. {s___, a_, a_,e___} :> {s,a,e}]-1;

nbrSwitches /@ 


Bob Hanlon

In article <c5j6vd$qqo$1 at>, "fake" <fake at> 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: Re: number of switches
  • Next by Date: Alternative to defining 'operator' function?
  • Previous by thread: Re: number of switches
  • Next by thread: Re: number of switches