Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #86994
| References | <CADgpKWb=q2=YEJSS1yRkgzF37nO5BNRnywm+zhcwF-MAOr6MdA@mail.gmail.com> |
|---|---|
| From | Ian Kelly <ian.g.kelly@gmail.com> |
| Date | 2015-03-06 00:10 -0700 |
| Subject | Re: Speeding up permutations generation |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.93.1425629533.21433.python-list@python.org> (permalink) |
On Thu, Mar 5, 2015 at 11:44 PM, Abhiram R <abhi.darkness@gmail.com> 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? A list of 100 elements has approximately 9.33 x 10**157 permutations. If you could somehow generate one permutation every yoctosecond, exhausting them would still take more than a hundred orders of magnitude longer than the age of the universe.
Back to comp.lang.python | Previous | Next | Find similar | Unroll thread
Re: Speeding up permutations generation Ian Kelly <ian.g.kelly@gmail.com> - 2015-03-06 00:10 -0700
csiph-web