MathGroup Archive 2004

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

Search the Archive

Re: number of switches

  • To: mathgroup at
  • Subject: [mg47507] Re: [mg47479] number of switches
  • From: Sseziwa Mukasa <mukasa at>
  • Date: Thu, 15 Apr 2004 03:39:10 -0400 (EDT)
  • References: <>
  • Sender: owner-wri-mathgroup at

On Apr 14, 2004, at 7:16 AM, 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)?

I don't know what you consider easy.  If you're list is not too long  
you can do it recursively



If you're worried about recursing too deeply do it iteratively




  • Prev by Date: Re: When Is Precision[ ] $MachinePrecision, And When Is It Not?
  • Next by Date: How to check if a file exists?
  • Previous by thread: number of switches
  • Next by thread: Re: number of switches