Ian Kelly schrieb am 06.03.2015 um 18:13:
> On Fri, Mar 6, 2015 at 1:24 AM, Abhiram R wrote:
>>> 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
On Fri, Mar 6, 2015 at 1:24 AM, Abhiram R wrote:
>
>>
>> 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 t
On Friday 06 March 2015 11:30:08 Dave Angel wrote:
> On 03/06/2015 11:14 AM, Gene Heskett wrote:
> > On Friday 06 March 2015 06:22:34 Dave Angel wrote:
> >> Sorry, but 50! is not even close to 50**50. The latter is 85
> >> digits as you say, but 50! is "only" 64.
> >>
> >>
> >> 30414093201713378
On 03/06/2015 05:14 PM, Gene Heskett wrote:
On Friday 06 March 2015 06:22:34 Dave Angel wrote:
30414093201713378043612608166064768844377641568960512L
What utility output that as an L ?
One called the python interactive interpreter used by many people on
this list (though it
On 03/06/2015 11:14 AM, Gene Heskett wrote:
On Friday 06 March 2015 06:22:34 Dave Angel wrote:
Sorry, but 50! is not even close to 50**50. The latter is 85 digits
as you say, but 50! is "only" 64.
30414093201713378043612608166064768844377641568960512L
What utility output th
On Friday 06 March 2015 06:22:34 Dave Angel wrote:
> On 03/06/2015 05:32 AM, Gene Heskett wrote:
> > On Friday 06 March 2015 03:24:48 Abhiram R wrote:
> >>> A list of 100 elements has approximately 9.33 x 10**157
> >>> permutations. If you could somehow generate one permutation every
> >>> yoctos
On Fri, Mar 6, 2015 at 9:33 PM, Mark Lawrence wrote:
>> Is the actual generation of permutations your problem? You mentioned
>> that you're using itertools, so I would expect that you're simply
>> iterating over that; I hope you're not immediately trying to construct
>> a list of them all, because
On 03/06/2015 01:44 AM, 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?
When dealing with large loops like that (or even permutations of 50,
which is also gy-normous [1]
On 03/06/2015 05:32 AM, Gene Heskett wrote:
On Friday 06 March 2015 03:24:48 Abhiram R wrote:
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 ma
On 06/03/2015 09:59, Chris Angelico wrote:
On Fri, Mar 6, 2015 at 7:24 PM, Abhiram R wrote:
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
magni
On Friday 06 March 2015 03:24:48 Abhiram R wrote:
> > 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
On Fri, Mar 6, 2015 at 7:24 PM, Abhiram R wrote:
>> 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 un
On 03/06/2015 09:34 AM, Mark Lawrence wrote:
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 tha
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
>
> 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/listi
On Thu, Mar 5, 2015 at 11:44 PM, 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?
A list of 100 elements has approximately 9.33 x 10**157 permutations.
If you could som
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*
--
https://mail.python.org/mailman/listinfo/python-list
17 matches
Mail list logo
