The automatic crowded group (social distance) detection algorithm is an algorithm that will locate individuals/crowds’ current positions, then store their position data to do the further calculation on their distance in Euclidean distance. This algorithm will not only find out which individual has breached the social distance restriction, but it will also detect which two of the crowds are too close for a healthy environment, as well as two individuals from two different crowds can also be too close yet they have not realized. The algorithm is based on a Python 3 environment, one of the most advanced programming languages in use, which is environmentally friendly to GUI makers. Keyword: Greedy Algorithm, Euclidean distance, Social Distance