## Introduction

In this article, I discuss and implement the following:

- Minkowski Distance
- Euclidean Distance
- Manhattan Distance
- Chebyshev Distance

The general metric for distance is the **Minkowski distance**. When lambda is equal to 1, it becomes the city block distance, and when lambda is equal to 2, it becomes the Euclidean distance. The special case is when lambda is equal to infinity (taking a limit), where it is considered as the Chebyshev distance.

public static double MinkowskiDistance(double[] X, double[] Y, int order)
{
int count = 0;
double distance = 0.0;
double sum = 0.0;
if (X.GetUpperBound(0) != Y.GetUpperBound(0))
{
throw new System.ArgumentException("the number of elements" +
" in X must match the number of elements in Y");
}
else
{
count = X.Length;
}
for (int i = 0; i < count; i++)
{
sum = sum + Math.Pow(Math.Abs(X[i] - Y[i]), order);
}
distance = Math.Pow(sum,(1/order));
return distance;
}

**Euclidean distance** is the most common use of distance. When people talk about distance, this is what they are referring to. Euclidean distance, or simply 'distance', examines the root of square differences between the coordinates of a pair of objects. This is most generally known as the Pythagorean theorem.

public static double EuclideanDistance(double [] X, double []Y)
{
int count = 0;
double distance = 0.0;
double sum = 0.0;
if(X.GetUpperBound(0) != Y.GetUpperBound(0))
{
throw new System.ArgumentException("the number of elements" +
" in X must match the number of elements in Y");
}
else
{
count = X.Length;
}
for (int i = 0; i < count; i++)
{
sum = sum + Math.Pow(Math.Abs(X[i] - Y[i]),2);
}
distance = Math.Sqrt(sum);
return distance;
}

The taxicab metric is also known as rectilinear distance, L1 distance or L1 norm, city block distance, **Manhattan distance**, or Manhattan length, with the corresponding variations in the name of the geometry. It represents the distance between points in a city road grid. It examines the absolute differences between the coordinates of a pair of objects.

public static double ManhattanDistance(double [] X, double []Y)
{
int count = 0;
double distance = 0.0;
double sum = 0.0;
if(X.GetUpperBound(0) != Y.GetUpperBound(0))
{
throw new System.ArgumentException("the number of elements" +
" in X must match the number of elements in Y");
}
else
{
count = X.Length;
}
for (int i = 0; i < count; i++)
{
sum = sum + Math.Abs(X[i] - Y[i]);
}
distance = sum;
return distance;
}

**Chebyshev distance** is also called the Maximum value distance, defined on a vector space where the distance between two vectors is the greatest of their differences along any coordinate dimension. In other words, it examines the absolute magnitude of the differences between the coordinates of a pair of objects.

public static double ChebyshevDistance(double[] X, double[] Y)
{
int count = 0;
if (X.GetUpperBound(0) != Y.GetUpperBound(0))
{
throw new System.ArgumentException("the number of elements" +
" in X must match the number of elements in Y");
}
else
{
count = X.Length;
}
double[] newData = new double[count];
for (int i = 0; i < count; i++)
{
newData[i] = Math.Abs(X[i] - Y[i]);
}
double max = double.MinValue;
foreach (double num in newData)
{
if (num > max)
{
max = num;
}
}
return max;
}

## Sources