What are steps one and two of the nearest neighbor $($NN$)$ algorithm?

$1.$

$2.$

$3.$ Make that index the current index.

$4.$ Repeat steps $2$ and $3.$