Write a function named primesBetween which takes two positive integer values, then prints all the prime numbers between these two numbers in increasing order (including the two numbers).
Assume the user will enter two positive integers which are greater than 2.
Examples:
140 120
|
127 131 137 139
|
3 11
|
3 5 7 11
|
1001 1051
|
1009 1013 1019 1021 1031 1033 1039 1049 1051
|
Important issues about all exams/projects/quizzes:
- Update just Question.c file, not Question.txt.
- Make changes only between the following comments(DO NOT modify these comments or anything outside the region marked by the comments):
- // DO_NOT_EDIT_ANYTHING_ABOVE_THIS_LINE
- // DO_NOT_EDIT_ANYTHING_BELOW_THIS_LINE
- If you modify these comments for any reason, you can copy/paste the initial version from Question.txt into Question.c. Note that Question.txt is not graded at all, so anything you write in Question.txt will be discarded.
- To avoid getting the 'Binary Not Found' error, SAVE and BUILD your code before RUN.
- Do not add any extra messages message for input/output such as 'Enter an integer:', 'The result is:', etc. Any additional text that appears in the output will cause you to get no points from the question.
- Input and output of your program must be just like those in the Examples table above.