Professional Documents
Culture Documents
Data Structure Ex5
Data Structure Ex5
Recursive
#include <stdio.h>
int main() {
int num;
printf("Enter a non-negative integer: ");
scanf("%d", &num);
if (num < 0) {
printf("Factorial is not defined for negative numbers.\n");
} else {
printf("Recursive Factorial of %d: %llu\n", num, factorialRecursive(num));
}
Return 0;
OUTPUT:
Enter a non-negative integer: 5
Recursive Factorial of 5: 120
NON RECURSIVE
#include <stdio.h>
int main() {
int num;
printf("Enter a non-negative integer: ");
scanf("%d", &num);
if (num < 0) {
printf("Factorial is not defined for negative numbers.\n");
} else {
printf("Non-Recursive Factorial of %d: %llu\n", num,
factorialNonRecursive(num));
}
return 0;
}
OUTPUT:
Enter a non-negative integer: 5
Non-Recursive Factorial of 5: 120
Recursive:
#include <stdio.h>
int main() {
int num1, num2;
printf("Enter two positive integers: ");
scanf("%d %d", &num1, &num2);
if (num1 <= 0 || num2 <= 0) {
printf("Please enter positive integers.\n");
} else {
printf("Recursive GCD of %d and %d: %d\n", num1, num2,
gcdRecursive(num1, num2));
}
return 0;
}
OUTPUT:
Enter two positive integers: 24 36
Recursive GCD of 24 and 36: 12
NON RECURSIVE:
#include <stdio.h>
return 0;
}
OUTPUT:
Enter two positive integers: 24 36
Non-Recursive GCD of 24 and 36: 12
int main() {
int numDisks;
printf("Enter the number of disks: ");
scanf("%d", &numDisks);
if (numDisks <= 0) {
printf("Please enter a positive number of disks.\n");
} else {
printf("Tower of Hanoi steps for %d disks (Recursive):\n", numDisks);
towerOfHanoiRecursive(numDisks, 'A', 'C', 'B');
}
return 0;
}
OUTPUT:
Enter the number of disks: 3
Tower of Hanoi steps for 3 disks (Recursive):
Move disk 1 from A to C
Move disk 2 from A to B
Move disk 1 from C to B
Move disk 3 from A to C
Move disk 1 from B to A
Move disk 2 from B to C
Move disk 1 from A to C
Non Recursive
#include <stdio.h>
int main() {
int numDisks;
printf("Enter the number of disks: ");
scanf("%d", &numDisks);
if (numDisks <= 0) {
printf("Please enter a positive number of disks.\n");
} else {
printf("Non-Recursive Tower of Hanoi solution is more complex.\n");
}
return 0;
}