views:

137

answers:

4

Say I wanted to create an array (NOT list) of 1,000,000 twos in python, like this:

array = [2, 2, 2, ...... , 2]

What would be a fast but simple way of doing it?

+4  A: 

Is this what you're after?

# slower.
twosArr = array.array('i', [2] * 1000000)

# faster.
twosArr = array.array('i', [2]) * 1000000

You can get just a list with this:

twosList = [2] * 1000000

-- EDITED --

I updated this to reflect information in another answer. It would appear that you can increase the speed by a ratio of ~ 9 : 1 by adjusting the syntax slightly. Full credit belongs to @john-machin. I wasn't aware you could multiple the array object the same way you could do to a list.

g.d.d.c
sloooow ... see my answer
John Machin
+1  A: 
aList = [2 for x in range(1000000)]

or base on chauncey link

anArray =array.array('i', (2 for i in range(0,1000000)))
+3  A: 

Using the timeit module you can kind of figure out what the fastest of doing this is:

First off, putting that many digits in a list will kill your machine most likely as it will store it in memory.

However, you can test the execution using something like so. It ran on my computer for a long time before I just gave up, but I'm on an older PC:

timeit.Timer('[2] * 1000000').timeit()

Ther other option you can look into is using the array module which is as stated, efficient arrays of numeric values

array.array('i', (2 for i in range(0, 1000000)))

I did not test the completion time of both but I'm sure the array module, which is designed for number sets will be faster.

Edit: Even more fun, you could take a look at numpy which actually seems to have the fastest execution:

from numpy import *
array( [2 for i in range(0, 1000000)])

Even faster from the comments:

a = 2 * ones(10000000)

Awesmoe!

Bartek
Numpy also has dedicated factory functions: `a = 2 * ones(1000000)`
Philipp
@Philipp: That's awesome! This is why I love SO. Curiosity to answer a question leads to many learnings for myself. Cheers :-)
Bartek
@Bartek: If you can't fit a million-element list or array into your machine's memory, it's dead already. Also, I don't understand "It ran on my computer for a long time" ... see my answer for (a) how to do simple timing using `timeit` at the command prompt (b) how small the measured times (milliseconds!) are (4-year-old laptop running Win XP SP2)
John Machin
+4  A: 

The currently-accepted answer is NOT the fastest way using array.array; at least it's not the slowest -- compare these:

[source: johncatfish (quoting chauncey), Bartek]
python -m timeit -s"import array" "arr = array.array('i', (2 for i in range(0,1000000)))"
10 loops, best of 3: 543 msec per loop

[source: g.d.d.c]
python -m timeit -s"import array" "arr = array.array('i', [2] * 1000000)"
10 loops, best of 3: 141 msec per loop

python -m timeit -s"import array" "arr = array.array('i', [2]) * 1000000"
100 loops, best of 3: 15.7 msec per loop

That's a ratio of about 9 to 1 ...

John Machin
+1 and I've updated my answer with the other syntax and a comment. Thank you for pointing it out.
g.d.d.c