# Picking pairs of objects from a list of 6

Given a list (a,b,c,d,e,f) What method can I use to quickly find all 15 pairings of two letters. I can do it without using a specific decision procedure throughout but sometimes combinations get repeated and its hard to check quickly which ones have already been. Essentially I would like an algorithm to find every combination of pairs in a set of arbitrary length/

Quantum Defect
Homework Helper
Gold Member
Given a list (a,b,c,d,e,f) What method can I use to quickly find all 15 pairings of two letters. I can do it without using a specific decision procedure throughout but sometimes combinations get repeated and its hard to check quickly which ones have already been. Essentially I would like an algorithm to find every combination of pairs in a set of arbitrary length/

Loop from x = 1 to N-1

[ Loop from y= x+1 to N

pair = list[x], list [y] ]

Quantum Defect
Homework Helper
Gold Member

list (1..N) => list = (a, b, c, d, e, f); N = number of members in the list; in this case, N = 6

The loops above, look like:

x=1, y = 2, 3, 4, 5, 6: pairs = (a,b), (a,c), (a,d), (a,e), (a,f)
x=2, y = 3, 4, 5, 6: pairs = (b, c), (b,d), (b,e), (b,f)
x=3, y = 4, 5, 6: pairs = (c,d), (c,e), (c,f)
x=4, y=5, 6,: pairs = (d,e), (d,f)
x=5, y = 6: pairs = (e,f)

I've just realised i have not asked the question i meant to ask sorry. What I meant was the find all the sets consisting of 3 uniques pairs from (a,b,c,d,e,f) so e.g. one will be
((a,b),(c,d),(e,f)) and another would be ((a,c),(b,e),(d,f))