research and implement the Sieve of Eratosthenes (also called prime sieve) algorithm. Researching and implementing algorithms is an important task for programmers. this assignment is also an exercise in arrays.

Example output:

------------Configuration: -----------------------

Enter the highest number to check (must be higher than 2): 200

The prime numbers between 2 and 200 are:

2 3 5 7 11 13 17 19 23 29 31

37 41 43 47 53 59 61 67 71 73

79 83 89 97 101 103 107 109 113 127

181 191 193 197 197 199

process completed.