Date: 08/19/06 (Algorithms)    Keywords: no keywords

Forgive me if this is elementary, I've been searching the tubes with no real luck for a while now.

I'm looking for the description of an algorithm to get all of the unique n-element combinations out of a given set.

So, given the set

[A, B, C, D, E]

and looking for combinations of threes, I'd want:

[
  [A, B, C],
  [A, B, D],
  [A, B, E],
  [A, C, D],
  [A, C, E],
  [A, D, E],
  [B, C, D],
  [B, C, E],
  [B, D, E],
  [C, D, E]
]

Source: http://community.livejournal.com/algorithms/82856.html