Algorithm 4: The K-NN Algorithm

1: Classify $(X,Y,x)$.

2: for $i=1$ to n do

3:          Calculate the Euclidean distance $d_E(X_i,x)$.

4: end.

5: Compute set I having the indices for the k smallest distances $d_E(X_i,x)$.

6: Return majority label for $Y_i$ where $i\in I$.