Export (0) Print
Expand All

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 noteSecurity Note

This sample code is intended to illustrate a concept, and it shows only the code that is relevant to that concept. It may not meet the security requirements for a specific environment, and it should not be used exactly as shown. We recommend that you add security and error-handling code to make your projects more secure and robust. Microsoft provides this sample code "AS IS" with no warranties.

To get samples and instructions for installing them:

To access samples from Visual Studio

  • On the Help menu, click Samples.

    By default, these samples are installed in drive:\Program Files\Microsoft Visual Studio 10.0\Samples\.

  • For the most recent version of this sample and a list of other samples, see Visual Studio Samples on the MSDN Web site.

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.

Show:
© 2014 Microsoft