Tag Archives: algorithms

Calculate the present value of a future amount of money in C#

Posted on May 29, 2017 by Rod Stephens

This example shows how to calculate the present value of a future amount of money. Suppose you want a certain amount of money in a given number of years and you know you can realize a specific interest rate (compounded … Continue reading →

Posted in algorithms, mathematics | Tagged algorithms, C#, C# programming, compound interest, discount value, example, example program, mathematics, present discounted value, present value, Windows Forms programming | Leave a comment

Make a 3D globe in WPF and C#

Posted on May 25, 2017 by RodStephens

This example shows how you can draw a 3D globe. More generally it shows how you can make a three-dimensional textured sphere in WPF. The example Draw smooth spheres using WPF and C# shows how to make smooth colored spheres. … Continue reading →

Posted in algorithms, drawing, geometry, graphics, mathematics, wpf, XAML | Tagged 3D, 3D globe, algorithms, C#, C# programming, drawing, example, example program, geometry, graphics, mathematics, sphere, tectured sphere, texture, Windows Forms programming, WPF, XAML | Leave a comment

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 →

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

Compare sorting algorithms in C#, article 5 of 5

Posted on April 21, 2017 by Rod Stephens

Countingsort The discussion of Quicksort in my previous post mentions that the fastest possible sorting algorithms that use comparisons take on the order of N * log(N) steps. Countingsort does not use comparisons so it is not bound by that … Continue reading →

Posted in algorithms, performance | Tagged algorithms, Array.Sort, bubblesort, C#, C# programming, countingsort, example, example program, performance, quicksort, selectionsort, sort arrays, sort values, sorting, Windows Forms programming | Leave a comment

Compare sorting algorithms in C#, part 4 of 5

Posted on April 21, 2017 by Rod Stephens

Quicksort Quicksort is a recursive algorithm that uses a divide-and-conquer technique. While the list of items to be sorted contains at least two items, Quicksort divides it into two sublists and recursively calls itself to sort the sublists. The Quicksort … Continue reading →

Posted in algorithms, performance | Tagged algorithms, Array.Sort, bubblesort, C#, C# programming, countingsort, example, example program, quicksort, selectionsort, sort arrays, sort values, sorting, Windows Forms programming | Leave a comment

Compare sorting algorithms in C#, part 3 of 5

Posted on April 20, 2017 by Rod Stephens

Selectionsort Selectionsort is a very simple algorithm. First you search the list for the smallest item. Then you swap that item with the item at the top of the list. Next you find the second smallest item and swap it … Continue reading →

Compare sorting algorithms in C#, part 2 of 5

Posted on April 19, 2017 by Rod Stephens

Bubblesort Bubblesort is a specialized algorithm designed for sorting items that are already mostly in sorted order. If only one or two items in your list are out of order, Bubblesort is very fast. If the items in your list … Continue reading →

Compare sorting algorithms in C#, post 1 of 5

Posted on April 18, 2017 by Rod Stephens

This post begins a series of articles about sorting algorithms. Much of the text originally appeared in the December 1995 issue of Visual Basic Developer magazine, a publication that seems to no longer exist. All of these posts include the … Continue reading →