-
-
Save ssartell/893fd190d88339bdfbcb545a8b4548c3 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* LINQ Puzzle #19 ******************************************************* | |
| Summary: Given a list integers, generate every pairwise combination of integers. Order of the pair | |
| doesn't matter, but { 1, 2 } is the same as { 2, 1 } and you shouldn't have duplicates. | |
| Sample: { 1, 2, 3, 4 } => {{1, 2}, {1, 3}, {1, 4}, {2, 3}, {2, 4}, {3, 4}} | |
| ************************************************************************/ | |
| var ints = new [] { 1, 2, 3, 4 }; |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment