0
$\begingroup$

I believe that I have a new algorithm for touring the permutations of a list. I have never formally studied Computer Science, so I do not know quite how to present my idea to a computer scientist. I have developed my idea through an insight into multi-dimensional geometry. (Nor am I professionally trained in Mathematics.)

My algorithm is different to the Heaps algorithm in that the positions of adjacent members of the list are exchanged at every step.

I have developed a little field of algebra which has helped me to define my algorithm.

If anybody responds with interest I'll be pleased to put in the effort required to translate my ideas into something that others can more readily understand.

:) Mark

Improve this question
$\endgroup$
4
  • 1
    $\begingroup$ This is a Q&A website. What is your question? $\endgroup$ Commented Mar 16 at 15:42
  • $\begingroup$ You can try to go to the computer science department in a university near you, and see if someone can check your algorithm. $\endgroup$ Commented Mar 16 at 19:33
  • $\begingroup$ Take a look at Steinhaus–Johnson–Trotter algorithm. Is there any essential difference? $\endgroup$ Commented Mar 17 at 5:48
  • $\begingroup$ Thanks to all, especially Smylic, who has correctly guessed the direction of my effort and saved me much trouble. $\endgroup$ Commented Mar 18 at 5:23

0

Reset to default

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.