# EUCLIDSTEP1 Sample: Provides a Baseline for the EUCLIDSTEP2 Sample

The EUCLIDSTEP1 sample is a pure C project that demonstrates Euclid's algorithm for finding the greatest common divisor. No .asm files are included in this project. This sample provides a baseline from which to expand to including an .asm file, as demonstrated in the EUCLIDSTEP2 sample.

Security Note
This sample code is provided to illustrate a concept and should not be used in applications or Web sites, as it may not illustrate the safest coding practices.

# Building and Running the Sample

#### To build and run this sample

1. Open the solution EuclidStep1.sln.

2. On the Build menu, click Build.

3. On the Debug menu, click Start Without Debugging.