void test_rec()
{
printf("\tTesting Recursion Algorithms...\n\n");
long num = 20;
printf("factorial of %ld = %ld\n", num, fact(num));
int len = 10000;
int i = 0;
int numbers[len];
for (i = 0; i < len; ++i)
numbers[i] = i + 1;
printf("sum of array = %d\n", sumArray(numbers, len));
printf("largest in array = %d\n", largest(numbers, len));
printf("largest in array = %d\n", largest2(numbers, 0, len - 1));
int big_num = 203041;
printf("sum of digits of %d = %d\n", big_num, sumOfDigits(big_num));
}
void main() {
int a[5] = { 90, 41, 34, 65, 65};
//finding the largest and second largest numbers
largest2(a);
_getch();
}
