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

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

• To: mathgroup at smc.vnet.net
• Subject: [mg52175] Re: Challenge: Fastest method to convert positive integers to 1 in a long list
• From: "Eckhard Hennig" <aidev at n-o-s-p-a-m.kaninkolo.de>
• Date: Sun, 14 Nov 2004 04:30:11 -0500 (EST)
• References: <cn4m4e$19p$1@smc.vnet.net>
• Sender: owner-wri-mathgroup at wolfram.com

"Carl K. Woll" <carlw at u.washington.edu> schrieb im Newsbeitrag
news:cn4m4e$19p$1 at smc.vnet.net...
> 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?

Sign[seq]

Best regards,

Eckhard

-- 
Dr.-Ing. Eckhard Hennig
www.kaninkolo.de/ai
aidev \at kaninkolo \dot de