List Calculation of distance between data points

If you are involved in the field of computer science then you are directly or indirectly will intersect with the search distance between two points. This distance search is often used because it is embedded or it is an important part of a particular algorithm. Suppose you may know the kmeans algorithm, the distance search for kmeans is used to determine the cluster of an input data, the distance search is also used in the nearest neighbor k algorithm to determine the neighbor of a data set where the data that has the closest distance to the target data becomes a neighbor. Distance calculation consists of several kinds of them:

1. Euclidean distance

2. Manhattan distance

3. Cosine distance

4. Chebyshev distance

5. Hamming distance

6. Mahalanobis distance

7. Akritean distance

8. Minkowski distance

9. Pythagorean addition

10. Haversine distance

11. Vincenty's formulae

Not all distance search methods have been used on a particular algorithm but they can be used for alternative paths to improve the performance of certain algorithms. Suppose algorithm k nearest neighbor and kmeans use euclidean distance. You can use other distance search methods to be used in your research with the aim of improving the performance of k nearest neighbor or kmeans algorithm.