Suppose I have a vector $X = (x_1, x_2 , . . . ,x_n)$, $x_i$ is the maximum of $X$ and $x_k$ is the minimum. Is it possible to use k-means algorithm to cluster the values in vector $X$ into two cluster. First, the values which are near to maximum value and the other cluster includes the values which are near to minimum value? If not, Is there another algorithm can do that task?