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.
.gif "Security note") 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. Microsoft assumes no liability for incidental or consequential damages should the sample code be used for purposes other than as intended. |
To get samples and instructions for installing them:
On the Visual Studio Help menu, click Samples.
For more information, see Visual Studio Samples.
The most recent version and complete list of samples is available online from the Visual Studio 2008 Samples page.
You can also locate samples on your computer's hard disk. By default, samples and a Readme file are copied into a folder under \Program Files\Visual Studio 9.0\Samples\. For Express editions of Visual Studio, all samples are located online.
Building and Running the Sample
To build and run this sample
Open the solution EuclidStep1.sln.
On the Build menu, click Build.
On the Debug menu, click Start Without Debugging.
See Also
Tasks
EUCLIDSTEP2 Sample: Demonstrates a Mixed C and ASM Project