Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


JT
Posts:
1,042
Registered:
4/7/12


Re: Time complexity, for finding all permutations from 1 to n
Posted:
Jun 19, 2013 8:14 AM


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?


Date

Subject

Author

6/19/13


JT

6/19/13


JT

6/20/13


JT

6/20/13


JT


