Ondrej Certik wrote:
> On Sun, Nov 9, 2008 at 9:08 AM, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
>> Hello,
>>
>> On Nov 8, 3:02 pm, "Ondrej Certik" <[EMAIL PROTECTED]> wrote:
>>
>>> On Sat, Nov 8, 2008 at 11:58 PM, Alan Bromborsky <[EMAIL PROTECTED]> wrote:
>>>
>>>
Does anyone k
On Sun, Nov 9, 2008 at 9:08 AM, Mike Hansen <[EMAIL PROTECTED]> wrote:
>
> Hello,
>
> On Nov 8, 3:02 pm, "Ondrej Certik" <[EMAIL PROTECTED]> wrote:
>> On Sat, Nov 8, 2008 at 11:58 PM, Alan Bromborsky <[EMAIL PROTECTED]> wrote:
>>
>> > Does anyone know a good (fast) way of determining the number of
Hello,
On Nov 8, 3:02 pm, "Ondrej Certik" <[EMAIL PROTECTED]> wrote:
> On Sat, Nov 8, 2008 at 11:58 PM, Alan Bromborsky <[EMAIL PROTECTED]> wrote:
>
> > Does anyone know a good (fast) way of determining the number of
> > permutations needed to order a short list of integers say 10 or less and
> >
On Sat, Nov 8, 2008 at 11:58 PM, Alan Bromborsky <[EMAIL PROTECTED]> wrote:
>
> Does anyone know a good (fast) way of determining the number of
> permutations needed to order a short list of integers say 10 or less and
> that would also return the ordered list?
Well, for 10 or less items, I gues
