int main(void) { listEvenNumbers(); printf("\nAll EVEN numbers between 0 and 100 (recursively):\n"); printf("------------------------------------------------\n"); listEvenNumbersRecursive(0); return EXIT_SUCCESS; }
int main(int argc, const char * argv[]) { // insert code here... listEvenNumbers(); printf("\nAll EVEN numbers between 0 and 100 recursively\n"); listEvenNumbersRecursive(0); return EXIT_SUCCESS; }
void listEvenNumbersRecursive(int k) { // doing it via recursion if (k <= 100) { printf("%d\n", k); // now the key - print the next in the series listEvenNumbersRecursive(k+2); } }
void listEvenNumbersRecursive(int k){ /* * A recursive call to a function is essentially a loop. * While it works, it is consumes a lot of computer memory. */ if(k <= 100){ printf("%d\n",k); listEvenNumbersRecursive(k+2); } }