Thanks, St?fan, speed: N ~ 1e9. Thanks again.
DG
--
Message: 1
Date: Sun, 22 Sep 2013 14:04:09 -0700
From: David Goldsmith d.l.goldsm...@gmail.com
Subject: [Numpy-discussion] Generating a (uniformly distributed)
random bit list of length N
To: numpy-discussion@scipy.org
Message-ID:
caftpszqg7upjy8s04npwkn8gjvdvgoru3rpjcvln6zkrwnp...@mail.gmail.com
Content-Type: text/plain; charset=iso-8859-1
Is np.random.randint(2, size=N) the fastest way to do this? Thanks!
DG
-- next part --
An HTML attachment was scrubbed...
URL:
http://mail.scipy.org/pipermail/numpy-discussion/attachments/20130922/b3cebeaa/attachment-0001.html
--
Message: 2
Date: Mon, 23 Sep 2013 03:22:06 +0200
From: St?fan van der Walt ste...@sun.ac.za
Subject: Re: [Numpy-discussion] Generating a (uniformly distributed)
random bit list of length N
To: Discussion of Numerical Python numpy-discussion@scipy.org
Message-ID:
cabdkgqkq829a_nj7xxcs5xauz-ptwcyf_zbslt+0gufnzwy...@mail.gmail.com
Content-Type: text/plain; charset=iso-8859-1
On 22 Sep 2013 23:04, David Goldsmith d.l.goldsm...@gmail.com wrote:
Is np.random.randint(2, size=N) the fastest way to do this? Thanks!
Are you concerned about speed or memory use? The operation you show should
already be quite fast. A more memory efficient approach would be to
generate integers and use their binary representation.
St?fan
-- next part --
An HTML attachment was scrubbed...
URL:
http://mail.scipy.org/pipermail/numpy-discussion/attachments/20130923/e4f56af4/attachment-0001.html
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
