We will give you two challenges in this article. Before we do so, we will tell you what the simplex algorithm for solving linear programming problems is. We will first show you a few simple cases. What is the simplex algorithm for linear programming? One-dimensional case Let $f$ be a linear function defined as $cx$, …
In this article, we will give you two challenges related to the $k$-nearest neighbor ($k$-NN) algorithm. Before we do so, we will explain to you what the $k$-nearest neighbor algorithm is. What is the k-Nearest Neighbor Algorithm? A simple case Let’s say there are points in some space, where some of them are colored yellow …
In this article, we present two challenges related to the recursive least square algorithm [1]. We will first explain what the recursive least square algorithm is. The Recursive Least Square Algorithm 1-Dimensional Case In the one-dimensional case, let’s say we have a linear relation of real numbers of the form $y=ax+e$, where $x$ is a …
What is a binary search tree? A binary tree T is a binary search tree if it satisfies the following conditions: T is an empty tree (represented by a null pointer), or T consists of: a) A root node B with a value x, b) A left subtree L, which is also a binary search …
An Implementation of a Binary Search Tree (BST) in C++ Read More »
What is a directed graph? In mathematics, a directed graph is a set with a not necessarily symmetric binary relation, meaning given any two elements x and y in that set, if x is related to y, it is not always the case that y is related to x. Pictorially, a directed graph is represented …
What is a directed acyclic graph? In mathematics, a directed graph is a set with a not necessarily symmetric binary relation, meaning given any two elements x and y in that set, if x is related to y, it is not always the case that y is related to x. Pictorially, a directed graph is …
An Example of a Directed Acyclic Graph in Python Read More »