Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Time complexity, for finding all permutations from 1 to n
Replies: 3   Last Post: Jun 20, 2013 5:30 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
JT

Posts: 1,041
Registered: 4/7/12
Re: Time complexity, for finding all permutations from 1 to n
Posted: Jun 19, 2013 8:14 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Den onsdagen den 19:e juni 2013 kl. 11:24:28 UTC+2 skrev jonas.t...@gmail.com:
> I guess it is some 0(n)+x comparrisons, a linear algorithm using comparssons?
>
> I think i have a linear algorithm that will do it without comparissons and doubles in linear time just a single swap for each new permutation table.
>
>
>
> A setup table is needed to calculate sizes factorials and respective swap within.
>
>
>
> Is this a known algorithm? Once the table created the algorithm run in linear swap time. The factorial table is used to find the size of the swaps.
>
>
>
> There is no copies of tables within the linear swap, no doubles.


Could someone give me a link pseudo code for the most effective known algorithm?



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.