Tag Archives: recursion

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 →

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

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 →

Posted in algorithms, mathematics | Tagged algorithms, branch and bound, C#, C# programming, example, example program, mathematics, optimization, path, recursion, Windows Forms programming | Leave a comment

Find the highest value path through a two-dimensional array of numbers in C#

Posted on December 8, 2017 by Rod Stephens

Posted in algorithms, mathematics | Tagged algorithms, C#, C# programming, example, example program, mathematics, optimization, path, recursion, Windows Forms programming | 1 Comment

Recursively draw equations in C#

Posted on September 7, 2017 by Rod Stephens

The basic idea for recursively drawing equations is simple. Well, sort of simple. Classes represent different kinds of equations. A particular class knows how to draw its kind of equation. It uses other classes to draw its pieces. For example, … Continue reading →

Posted in algorithms, drawing, fonts, graphics, recursion | Tagged algorithms, C#, C# programming, draw equations, drawing, equations, example, example program, fonts, graphics, recursion, Windows Forms programming | 2 Comments

Iterate over items in an array with unknown dimensions in C#

Posted on August 25, 2017 by Rod Stephens

This example shows how you can iterate over the items in an array that has an unknown number of dimensions. When it starts, the program executes the following code. private void Form1_Load(object sender, EventArgs e) { string[, ,] values = … Continue reading →

Posted in algorithms, arrays, syntax | Tagged algorithms, arrays, C#, C# programming, dimensions, example, example program, iterate, iterate items, loop over items, recursion, syntax, unknown dimensions, Windows Forms programming | 2 Comments

Enumerate TreeView nodes in C#

Posted on April 27, 2017 by RodStephens

The previous two posts show two ways you can enumerate TreeView nodes that are checked. The idea is to recursively crawl over the tree’s nodes and pick out the checked ones. Unfortunately that method isn’t easily extendable. For example, if … Continue reading →

Posted in algorithms, controls, recursion, user interface | Tagged algorithms, C#, C# programming, checked TreeView nodes, controls, example, example program, recursion, recursively, TreeNode, TreeNodeCollection, TreeView, TreeView nodes, user interface, Windows Forms programming, yield, yield return | Leave a comment

Yield checked TreeView nodes in C#

Posted on April 26, 2017 by RodStephens

The previous example used recursion to traverse the nodes in a TreeView control and fill a list with the nodes that are checked. This example uses a slightly different approach. It traverses the TreeView control’s nodes and uses the yield … Continue reading →

Make a list of checked TreeView nodes in C#

Posted on April 25, 2017 by RodStephens

If you set a TreeView control’s CheckBoxes property to true, then the control displays boxes that the user can check to select nodes. In that case you will probably need to find the checked TreeView nodes at some point. Strangely … Continue reading →