利用分治算法求一个数组首个零的位置，MPI算法，数组长度可以上万-partition algorithm using an array for the first zero position, MPI algorithm, the array length can be up to 10,000

How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the f