Was this page helpful?
Your feedback about this content is important. Let us know what you think.
Additional feedback?
1500 characters remaining
Export (0) Print
Expand All
Important This document may not represent best practices for current development, links to downloads and other resources may no longer be valid. Current recommended version can be found here.

PRIMESSTEP1 Sample: Provides a Baseline for the PRIMESSTEP Sample Series 

Download sample

The PRIMESSTEP1 sample is a pure C project that demonstrates the sieve of Eratosthenes to find prime numbers. 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 PRIMESSTEP2 sample.

This implementation uses a global array as a principal data structure.

Security noteSecurity 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.

Building and Running the Sample

To build and run this sample

  1. Open the solution PrimesStep1.sln.

  2. On the Build menu, click Build.

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

See Also

Community Additions

ADD
Show:
© 2015 Microsoft