Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #86999 > unrolled thread
| Started by | Mark Lawrence <breamoreboy@yahoo.co.uk> |
|---|---|
| First post | 2015-03-06 08:34 +0000 |
| Last post | 2015-03-06 08:34 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.lang.python
This discussion starts older than the indexed window; earlier articles aren't shown. The article labeled Started by
below is the oldest one visible, not the original post.
Re: Speeding up permutations generation Mark Lawrence <breamoreboy@yahoo.co.uk> - 2015-03-06 08:34 +0000
| From | Mark Lawrence <breamoreboy@yahoo.co.uk> |
|---|---|
| Date | 2015-03-06 08:34 +0000 |
| Subject | Re: Speeding up permutations generation |
| Message-ID | <mailman.97.1425630905.21433.python-list@python.org> |
On 06/03/2015 06:44, Abhiram R wrote: > Hi all, > Is there a way to generate permutations of large arrays of sizes say,in > the hundreds, faster than in the time itertools.permutations() can return? > > -Abhiram.R > /~Never give up/ > If there is I'd guess that you'd use numpy http://www.numpy.org/. The more mathematically minded may well be able to give better answers. -- My fellow Pythonistas, ask not what our language can do for you, ask what you can do for our language. Mark Lawrence
Back to top | Article view | comp.lang.python
csiph-web