Algorithms and Data Structures implemented in JavaScript for beginners, following best practices.
|
/**
|
||
|
|
* @see [Wikipedia](https://en.wikipedia.org/wiki/Euclidean_distance)
|
||
|
|
* Calculate the Euclidean distance between two vectors.
|
||
|
|
* @param {number[]} vector1 - The first vector.
|
||
|
|
* @param {number[]} vector2 - The second vector.
|
||
|
|
* @returns {number} The Euclidean distance between the two vectors.
|
||
|
|
*/
|
||
|
|
|
||
|
|
const EuclideanDistance = (vector1, vector2) => {
|
||
|
|
let sumOfSquares = 0
|
||
|
|
|
||
|
|
for (let i = 0; i < vector1.length; i++) {
|
||
|
|
sumOfSquares += Math.pow(vector1[i] - vector2[i], 2)
|
||
|
|
}
|
||
|
|
|
||
|
|
return Math.sqrt(sumOfSquares)
|
||
|
|
}
|
||
|
|
|
||
|
|
export { EuclideanDistance }
|