However, the k-means algorithm has at least two major theoretic shortcomings: First, it has been shown that the worst case running time of the algorithm is super-polynomial in the input size.
Međutim, k-means algoritam ima najmanje dva glavna teorijska nedostatka: Prvo, pokazano se da je najgori slučaj rada algoritma super-polinomijalno vreme u početnom stanju.