haas:spring2016:cprog:projects:pnc0
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:spring2016:cprog:projects:pnc0 [2016/02/27 13:10] – [further optimization] wedge | haas:spring2016:cprog:projects:pnc0 [2016/02/27 13:13] (current) – [Program] wedge | ||
|---|---|---|---|
| Line 123: | Line 123: | ||
| * [[https:// | * [[https:// | ||
| * [[https:// | * [[https:// | ||
| - | * [[https:// | + | * [[https:// |
| + | |||
| + | Of particular note: the sieve algorithms take advantage of a increased storage space, where others (like brute force) are predominantly time-based. The sieve is also more detailed... even if you don't decide to implement a sieve, take a look and compare the algorithm to what you've done to see the differences in approaches. | ||
| =====Program===== | =====Program===== | ||
| It is your task to write 3 separate prime number calculating programs: | It is your task to write 3 separate prime number calculating programs: | ||
| - | - primebrute.c: | + | - **primebrute.c**: for your brute force implementation |
| - | - primesqrt.c: | + | - **primesqrt.c**: for your square root-optimization of the brute force |
| - | - primeopt.c: for your optimized solution, be it basing off the existing ones, or taking a different approach | + | - **primeopt.c**: for your optimized solution, be it basing off the existing ones, or taking a different approach |
| Your program should: | Your program should: | ||
haas/spring2016/cprog/projects/pnc0.1456578651.txt.gz · Last modified: 2016/02/27 13:10 by wedge
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
