45 lines
1.9 KiB
Markdown
45 lines
1.9 KiB
Markdown
# Nth Prime
|
|
|
|
Write a program that can tell you what the nth prime is.
|
|
|
|
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that
|
|
the 6th prime is 13.
|
|
|
|
If your language provides methods in the standard library to deal with prime
|
|
numbers, pretend they doesn't exist and implement them yourself.
|
|
|
|
## Getting Started
|
|
|
|
Make sure you have read the [getting started with C++](http://help.exercism.io/getting-started-with-cpp.html)
|
|
page on the [exercism help site](http://help.exercism.io/). This covers
|
|
the basic information on setting up the development environment expected
|
|
by the exercises.
|
|
|
|
## Passing the Tests
|
|
|
|
Get the first test compiling, linking and passing by following the [three
|
|
rules of test-driven development](http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd).
|
|
Create just enough structure by declaring namespaces, functions, classes,
|
|
etc., to satisfy any compiler errors and get the test to fail. Then write
|
|
just enough code to get the test to pass. Once you've done that,
|
|
uncomment the next test by moving the following line past the next test.
|
|
|
|
```C++
|
|
#if defined(EXERCISM_RUN_ALL_TESTS)
|
|
```
|
|
|
|
This may result in compile errors as new constructs may be invoked that
|
|
you haven't yet declared or defined. Again, fix the compile errors minimally
|
|
to get a failing test, then change the code minimally to pass the test,
|
|
refactor your implementation for readability and expressiveness and then
|
|
go on to the next test.
|
|
|
|
Try to use standard C++11 facilities in preference to writing your own
|
|
low-level algorithms or facilities by hand. [CppReference](http://en.cppreference.com/)
|
|
is a wiki reference to the C++ language and standard library. If you
|
|
are new to C++, but have programmed in C, beware of
|
|
[C traps and pitfalls](http://www.slideshare.net/LegalizeAdulthood/c-traps-and-pitfalls-for-c-programmers).
|
|
|
|
## Source
|
|
|
|
A variation on Problem 7 at Project Euler [view source](http://projecteuler.net/problem=7)
|