Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #86997 > unrolled thread
| Started by | Abhiram R <abhi.darkness@gmail.com> |
|---|---|
| First post | 2015-03-06 13:54 +0530 |
| Last post | 2015-03-06 13:54 +0530 |
| 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 Abhiram R <abhi.darkness@gmail.com> - 2015-03-06 13:54 +0530
| From | Abhiram R <abhi.darkness@gmail.com> |
|---|---|
| Date | 2015-03-06 13:54 +0530 |
| Subject | Re: Speeding up permutations generation |
| Message-ID | <mailman.95.1425630624.21433.python-list@python.org> |
[Multipart message — attachments visible in raw view] — view raw
> > 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. > -- > https://mail.python.org/mailman/listinfo/python-list > True that :D I may have exaggerated on the number. Let's consider something more practically manageable => 50 elements with a 50! permutation. Is there a solution now? -Abhiram.R *~Never give up*
Back to top | Article view | comp.lang.python
csiph-web