Tag Archives: recursion

Draw a randomly colored Sierpinski octagon in C#

Posted on December 8, 2018 by RodStephens

This example draws a randomly colored Sierpinski octagon. It’s basically the same as the example Draw a randomly colored Sierpinski pentagon in C# except it draws an octagon instead of a pentagon. See that example for most of the details. … Continue reading →

Posted in algorithms, fractals, graphics, recursion | Tagged C#, C# programming, drawing, example, example program, fractals, graphics, recursion, Sierpinski, Sierpinski octagon, Windows Forms programming | Leave a comment

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

Tile a board with colored trominoes in C#

Posted on October 12, 2018 by RodStephens

The post Tile a board with trominoes in C# explains how to tile a board with a missing square with trominoes. This post shows how to color the trominoes so no two adjacent ones share the same color. The four-color … Continue reading →

Posted in algorithms, drawing, graphics, mathematics, recursion | Tagged algorithms, C#, C# programming, colored trominoes, drawing, example, example program, graphics, induction, inductive proofs, mathematics, polyomino, polyominoes, proof, proofs, recursion, tromino, trominoes, Windows Forms programming | 1 Comment

Tile a board with trominoes in C#

Posted on October 9, 2018 by RodStephens

Trominoes are polyominoes of order three. That means they are polygons made up of three equal sized squares joined at their edges. There only are two kinds of trominoes: three squares joined in a line and three squares joined in … Continue reading →

Posted in algorithms, drawing, graphics, mathematics, recursion | Tagged algorithms, C#, C# programming, drawing, example, example program, graphics, induction, inductive proofs, mathematics, polyomino, polyominoes, proof, proofs, recursion, tromino, trominoes, Windows Forms programming | 1 Comment

Draw a randomly colored Sierpinski pentagon in C#

Posted on October 4, 2018 by RodStephens

The example Draw a colored Sierpinski pentagon in C# lets the user click on the parts of a Sierpinski pentagon to change their colors. Eddie Bole thought it would be interesting to color the larger pentagons in addition to the … Continue reading →

Posted in drawing, fractals, graphics, recursion | Tagged C#, C# programming, drawing, example, example program, fractals, graphics, recursion, recursively, Sierpinski pentagon, Windows Forms programming | 5 Comments

Draw a colored Sierpinski pentagon in C#

Posted on October 1, 2018 by RodStephens

The example Draw a Sierpinski pentagon in C# shows how to draw a Sierpinski pentagon. This example modifies that one so the user can click on pentagons to change their colors. To do that, this program takes a very different … Continue reading →

Draw a Pythagoras tree fractal in C#

Posted on April 27, 2018 by RodStephens

A Pythagoras tree (or Pythagorean tree) is a fractal tree built from squares. It starts with a square that forms the tree’s base. The program then makes the Pythagoras tree by recursively attaching two smaller branches to the original branch. … Continue reading →

Posted in drawing, fractals, graphics, recursion | Tagged C#, C# programming, drawing, example, example program, fractals, graphics, Pythagoras tree, Pythagorean tree, recursion, Windows Forms programming | 1 Comment

Draw a Sierpinski pentagon in C#

Posted on April 25, 2018 by RodStephens

In a Sierpinski pentagon, larger pentagons are recursively divided into five smaller pentagons with a sixth uncolored pentagon in the center. The following picture shows the first four levels of the resulting fractal. For this example, I decided to think … Continue reading →

Write a TreeView into a tab-delimited file in C#

Posted on January 8, 2018 by RodStephens

The example Load a TreeView from a tab-delimited file in C# shows how to load a TreeView control from a file. This example shows how to do the converse: write a TreeView control’s values into a file. The following SaveTreeViewIntoFile … Continue reading →

Posted in algorithms, controls, files, recursion | Tagged algorithms, C#, C# programming, controls, example, example program, files, recursion, tabs, TreeNode, TreeView, Windows Forms programming | Leave a comment

Use branch and bound to find the highest value path through a two-dimensional array of numbers in C#

Posted on December 11, 2017 by Rod Stephens

This method is similar to path-finding methods described in my books Essential Algorithms: A Practical Approach to Computer Algorithms and Interview Puzzles Dissected, Solving and Understanding Interview Puzzles. Follow those links for more information including tables of contents. The example … Continue reading →