 
 (defn distance
   "Implements euclidian distance between two vectors"
-  ([[p1 p2] [q1 q2]]
-    (Math/sqrt (+ (Math/pow (- q1 q2) 2) (Math/pow (- p1 p2) 2)))))
-    ; (->> (map - c1 c2) (map #(* % %)) (reduce +))))) ; This is a better implementation for when this gets parallelised
+  ([c1 c2]
+    (->> (map - c1 c2) (map #(* % %)) (reduce +)))) ; This is a better implementation for when this gets parallelised
 
 (defn min-index
   [c]

(defn -main
  "Main function for k-means"
  [& args]
  (k-means [[1 2] [3 2] [6 3] [1 8] [9 10] [1 4]] 3))


(defn still-moving?
  "Predicate to test if the centroids have not reached equlibrium"
  [t c]
  (= t c))

(defn mean
  "Retrieve the mean value of a list"
