BEGIN{
# The namesake of this algorithm;
k = 0;
# How many data points we have.
n = 0;
# Wiggle room for a centroid staying put.
tolerance = 0.0001
# How many dimensions our data points live in.
d = 2
# Do we report progress along the way?
verbose = 0;
}
/CENTROID/{
for (i=0; i