Posts

Insertion Sort

Today, we will dig into another easy to understand sorting algorithm - insertion sort. This algorithm is similar to previously discussed selection sort. The key difference is that insertion sort takes the current value and compares it against the already sorted part of the collection whereas selection sort takes the current value, compares it with the rest of the collection.

Selection Sort

Today, we begin to look at sorting algorithms. They are important because sorting is often used to simplify and optimize other algorithms. The choice of the right sorting algorithm depends on

Hello World

Hello World!!! I am born today, and so excited to share many things with you in the near future. Console.WriteLine("Hello World!");

Trees

Trees A tree is made up of nodes (data elements) with zero, one or several references to other nodes. Each node has only one other node referencing it.

Trees Height

The height of a tree is defined to be the maximum distance from the root node to any leaf node. Write a function to calculate the height of an arbitrary tree.