Tag Archives: combinations

New Book: The Modern C# Challenge

Posted on October 29, 2018 by RodStephens

My latest book, The Modern C# Challenge, is now available. It’s a collection of 100 programming challenges that let you test your ability in a wide variety of programming topics, many of which are not usually covered in traditional programming … Continue reading →

Posted in algorithms, books, files, mathematics, puzzles | Tagged algorithms, books, C#, C# programming, combinations, cryptography, directories, dynamic programming, example, example program, factors, files, geometry, mathematics, permutations, prime factors, puzzles, randomization, recursion, simulations, statistics, The Modern C# Challenge, Windows Forms programming, yield | 1 Comment

Generate words of a given length in C#

Posted on August 5, 2016 by Rod Stephens

The example Generate three-letter words in C# uses three nested for loops to generate words that contain three letters. This example uses the following code to generate words of any given length. // Generate words with num_letters letters. private List … Continue reading →

Posted in algorithms, mathematics | Tagged algorithms, C#, C# programming, combinations, combinatorics, example, example program, generate words, letter combinations, mathematics, three-letter words, Windows Forms programming, words | 3 Comments

Generate three-letter words in C#

Posted on August 5, 2016 by Rod Stephens

This example uses the following very simple code to generate three-letter words using the letters a through z. // Make the items. private void Form1_Load(object sender, EventArgs e) { List<string> values = new List<string>(); for (char ch1 = ‘a’; ch1 … Continue reading →

Posted in algorithms, mathematics | Tagged algorithms, C#, C# programming, combinations, combinatorics, example, example program, letter combinations, three-letter words, Windows Forms programming, words | Leave a comment

Select N random items from an array in C#

Posted on January 12, 2015 by Rod Stephens

This example builds a generic extension method that lets you easily select N random objects from an array. For example, it lets you select 5 items from an array holding 10 names. Picking one random item from an array is … Continue reading →

Posted in algorithms, arrays, mathematics, variables | Tagged algorithms, arrays, C#, C# programming, choose, combinations, combinatorics, example, example program, mathematics, n choose m, pick, variables, Windows Forms programming | 1 Comment

Generate all selections of K items from a set of N items in C#

Posted on August 10, 2014 by Rod Stephens

This example is somewhat similar to Generate all of the permutations of a set of objects in C#. The basic idea is to use a recursive method to assign the next item to the combination. The first call to the … Continue reading →

Posted in algorithms, combinatorics, mathematics | Tagged algorithms, binomial coefficient, C#, C# programming, calculations, choose, combinations, combinatorial, combinatorics, example, example program, factorial, mathematics, n choose k, selections, Windows Forms programming | 3 Comments

Generate all of the permutations of a set of objects in C#

Posted on August 10, 2014 by Rod Stephens

The basic idea is to use a recursive method to assign the next item in a permutation. The first call to the method assigns the permutation’s first item, the next call assigns the second item, and so forth. To assign … Continue reading →