14 Jul
2005
14 Jul
'05
6:05 a.m.
Elisha Berns ha escrito:
Hi,
I have some confusion regarding which type of container/algorithm to use to optimize the lookup (not necessarily the insertion) of unique pairs where the definition of unique is:
Either member of the pair can occur an infinite/unbounded number of times provided the other member of the pair never occurs more than once: (3,4), (3,5), (3,6), (6,6), (5,6), (4,6)... etc.
The constraint is not entirely clear to me. Is the following allowed? (3,4),(4,3) Joaquín M López Muñoz Telefónica, Investigación y Desarrollo