"Tim Love" <(E-Mail Removed)> wrote in message news:c7vu3k$5hi$(E-Mail Removed)...

> "Alex Vinokur" <(E-Mail Removed)> writes:

>

> >Does STL contain algorithms which generate (enable to generate) exponents, permutations, arrangements, and combinations for any

> >numbers and words?

>

> exponents?

>
[snip]

See

http://www.saliu.com/permutations.html
-------------------------------------------------

An example of exponents (N=3, M=3): 111,112,113,121,122,123,131,132, etc. (a total of 27 sets).

An example of permutations (for N = 3): 1 2 3, 1 3 2, 2 1 3, 2 3 1, 3 1 2, 3 2 1.

An example of arrangements (for N = 3, M = 2): 1 2, 1 3, 2 1, 2 3, 3 1, 3 2.

An example of combinations (for N = 3, M = 2): 1 2, 1 3, 2 3.

-------------------------------------------------

--

Alex Vinokur

(E-Mail Removed)

http://mathforum.org/library/view/10978.html