MathGroup Archive 2004

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

Search the Archive

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


Hi all,

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?

Carl Woll 



  • Prev by Date: Accumulating error counts?
  • Next by Date: Matrix Dot Product
  • Previous by thread: Re: Accumulating error counts?
  • Next by thread: Re: Challenge: Fastest method to convert positive integers to 1 in a long list