This article covers the tree data structure. In particular: the unbalanced binary search tree and its implementations are investigated. Pitfalls of these implementations are discussed in terms of time and space efficiency. Mitigation of these through the AVL tree is presented and quantified by establishing an upper-bound on search time complexity.
Visual basic .NET was launched as a successor to Visual Basic in 2002. It runs on the .NET framework and is multi-paradigm and object-oriented. As far as I’m aware multi-paradigm refers to the language’s ability to support more than one programming paradigm or style, for example - to support OOP in combination with imperative and procedural styles. VB.NET is being deprecated as the language will not have any new features added to it....
Today, we take a break from my series on sorting algorithms and look at thread-safety. As a result, we will learn about threads and create a multi-threaded program. Then, we learn about thread safety and implement it in a C# console application. What are threads? Every program I have ever written has had a single sequential flow of control. Once the program begins executing, it systematically goes through every line of code until the end....
This is the third post in my series on sorting algorithms. Previously, I talked about the selection sorting algorithm (Link Here). Today, we take a look at the bubble sort algorithm. Later, we implement this in a .net core console application. Bubble sort is considered to be one of the simplest sorting algorithms. This algorithm works from right to left. On each pass, it compares each array item with its right neighbor....
This is the second post in my series on sorting algorithms. Previously, I talked about the insertion sorting algorithm (Link Here). Today, we take a look at the selection sort algorithm. Later, we implement this in a .net core console application. Selection sort is one of the elementary sorting algorithms. It sorts the data by finding the smallest item and swapping it into the array in the first unsorted location. The algorithm enumerates the array from the first unsorted item to the end....