On Sun, May 16, 2010 at 12:14 PM, Davide Lasagna <[email protected]> wrote: > Hi all, > What is the fastest and lowest memory consumption way to compute this? > y = np.arange(2**24) > bases = y[1:] + y[:-1] > Actually it is already quite fast, but i'm not sure whether it is occupying > some temporary memory > is the summation. Any help is appreciated.
Is it OK to modify y? If so: >> y = np.arange(2**24) >> z = y[1:] + y[:-1] # <--- Slow way >> y[:-1] += y[1:] # <--- Fast way >> (y[:-1] == z).all() True _______________________________________________ NumPy-Discussion mailing list [email protected] http://mail.scipy.org/mailman/listinfo/numpy-discussion
