欧几里德算法又称辗转相除法，用于计算两个整数a,b的最大公约数。分别用C++和JAVA实现。-Euclidean algorithm, also known as division algorithm, used to calculate the two integers a, b the common denominator. Separately using C++ and JAVA implementation.

一个用java写的欧几里德距离的kmeans算法，以前做实验自己写的-code of KMeans based on Euclidean Distance

实现了KNN文本的分类，KNN最近邻基于欧几里德距离的JAVA算法实现适用于初级学习KNN的初学者。-Realization of KNN text classification, KNN nearest neighbor JAVA algorithm for Euclidean distance implementation is applied to the primary learning KNN beginners based on.