I don't have my text book in front of me, but this can be seen as a graphing problem.

Take N items and put them in a fully connected complete graph. Everything is connected to everything. What you are asking for is all paths of length 2, in the case of nP2 I believe it's an n^3'd problem involving three for loops (update, i thought it was two, but my heart says 3).

If you don't have to store all of your text somewhere, you can probably derive the letters by their indicies (i=0 is the same as i=A, i=1 is the same as i=B).

It's not a solution, but if you take a look at some graphing algorithm chapters, it may give you some ideas.

In reply to Re: Searching for a Permutation Algorithm for nPr where n != r by exussum0
in thread Searching for a Permutation Algorithm for nPr where n != r by ozboomer

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.