MathGroup Archive 2004

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

Search the Archive

Re: Challenge: Fastest method to convert positive integers to 1 in a long list


"Carl K. Woll" wrote


>Inspired by the recent thread on counting runs, I have the following
>challenge. Come up with a method to convert all the positive integers in a
>long sequence of nonnegative integers to 1, so that the sequence consists
>of only 0s and 1s. Let the sequence be given by
>
>seq = Table[Random[Integer, 10], {10^6}];
>
>Then, one technique is
>
>newseq = 1+Quotient[#,#+1,1]&@seq;
>
>Can anyone do better?

Can't test it right now, but how about

newseq = Sign@seq;

?
cheers,
Peltio




  • Prev by Date: Re: Counting Runs
  • Next by Date: Re: Challenge: Fastest method to convert positive integers to 1 in a long list
  • Previous by thread: Re: Challenge: Fastest method to convert positive integers to 1 in a long list
  • Next by thread: Re: Challenge: Fastest method to convert positive integers to 1 in a long list