1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
#include <stdio.h>
#include <string.h>
#include <limits.h>
#include "ex00/ft_iterative_factorial.c"
#include "ex01/ft_recursive_factorial.c"
#include "ex02/ft_iterative_power.c"
#include "ex03/ft_recursive_power.c"
#include "ex04/ft_fibonacci.c"
#include "ex05/ft_sqrt.c"
#include "ex06/ft_is_prime.c"
#include "ex07/ft_find_next_prime.c"
#include "ex08/ft_queens.c"
int main()
{
printf("%d! = %d\n", -1, ft_iterative_factorial(-1));
printf("%d! = %d\n", 0, ft_iterative_factorial(0));
printf("%d! = %d\n", 1, ft_iterative_factorial(1));
printf("%d! = %d\n", 4, ft_iterative_factorial(4));
printf("%d! = %d\n", 6, ft_iterative_factorial(6));
printf("%d! = %d\n", 10, ft_iterative_factorial(10));
printf("---------------------\n");
printf("%d! = %d\n", -1, ft_recursive_factorial(-1));
printf("%d! = %d\n", 0, ft_recursive_factorial(0));
printf("%d! = %d\n", 1, ft_recursive_factorial(1));
printf("%d! = %d\n", 4, ft_recursive_factorial(4));
printf("%d! = %d\n", 6, ft_recursive_factorial(6));
printf("%d! = %d\n", 10, ft_recursive_factorial(10));
printf("---------------------\n");
printf("%d^%d = %d\n", 2, 0, ft_iterative_power(2, 0));
printf("%d^%d = %d\n", 2, 2, ft_iterative_power(2, 4));
printf("%d^%d = %d\n", 3, 3, ft_iterative_power(3, 3));
printf("%d^%d = %d\n", 4, 5, ft_iterative_power(4, 5));
printf("%d^%d = %d\n", -4, 5, ft_iterative_power(-4, 5));
printf("---------------------\n");
printf("%d^%d = %d\n", 1, -9, ft_recursive_power(1, -9));
printf("%d^%d = %d\n", 2, 0, ft_recursive_power(2, 0));
printf("%d^%d = %d\n", 2, 2, ft_recursive_power(2, 4));
printf("%d^%d = %d\n", 3, 3, ft_recursive_power(3, 3));
printf("%d^%d = %d\n", 4, 5, ft_recursive_power(4, 5));
printf("%d^%d = %d\n", -4, 5, ft_iterative_power(-4, 5));
printf("---------------------\n");
printf("F%d = %d\n", -1, ft_fibonacci(-1));
printf("F%d = %d\n", 0, ft_fibonacci(0));
printf("F%d = %d\n", 1, ft_fibonacci(1));
printf("F%d = %d\n", 2, ft_fibonacci(2));
printf("F%d = %d\n", 3, ft_fibonacci(3));
printf("F%d = %d\n", 4, ft_fibonacci(4));
printf("F%d = %d\n", 5, ft_fibonacci(5));
printf("F%d = %d\n", 8, ft_fibonacci(8));
printf("F%d = %d\n", 30, ft_fibonacci(30));
/*printf("F%d = %d\n", 41, ft_fibonacci(41));*/
printf("---------------------\n");
printf("sqrt(%d) = %d\n", -36, ft_sqrt(-36));
printf("sqrt(%d) = %d\n", 0, ft_sqrt(0));
printf("sqrt(%d) = %d\n", 4, ft_sqrt(4));
printf("sqrt(%d) = %d\n", 7, ft_sqrt(7));
printf("sqrt(%d) = %d\n", 9, ft_sqrt(9));
printf("sqrt(%d) = %d\n", 678, ft_sqrt(678 * 678));
printf("sqrt(%d) = %d\n", 5555 * 5555, ft_sqrt(5555 * 5555));
printf("sqrt(%d) = %d\n", 10000 * 10000, ft_sqrt(10000 * 10000));
/*for (int i = 0; i < INT_MAX; i++)*/
/*if (ft_sqrt(i))*/
/*printf("sqrt(%d) = %d\n", i, ft_sqrt(i));*/
printf("---------------------\n");
printf("prime(%d) = %d\n", 3, ft_is_prime(3));
printf("prime(%d) = %d\n", 25, ft_is_prime(25));
printf("prime(%d) = %d\n", 17, ft_is_prime(17));
printf("prime(%d) = %d\n", 21, ft_is_prime(21));
printf("prime(%d) = %d\n", 36, ft_is_prime(36));
printf("prime(%d) = %d\n", 2147483617, ft_is_prime(2147483617));
printf("prime(%d) = %d\n", 2147483629, ft_is_prime(2147483629));
printf("prime(%d) = %d\n", 2147483647, ft_is_prime(2147483647));
printf("prime(%d) = %d\n", 899, ft_is_prime(899));
printf("prime(%d) = %d\n", 289, ft_is_prime(289));
printf("prime(%d) = %d\n", 2147483424, ft_is_prime(2147483424));
// for (int i = INT_MAX; i > INT_MAX - 1000000; i--)
// printf("%d is %d\n", i, ft_is_prime(i));
// for (int i = 3; i <= 41; i++)
// printf("%d is %d\n", i, ft_is_prime(i));
printf("---------------------\n");
printf("nextp(%d) = %d\n", 21, ft_find_next_prime(21));
printf("nextp(%d) = %d\n", 23, ft_find_next_prime(23));
printf("prime(%d) = %d\n", 2147483424, ft_find_next_prime(2147483424));
printf("nextp(%d) = %d\n", 2147483600, ft_find_next_prime(2147483600));
/*for (int i = INT_MAX; i > INT_MAX - 1000000; i--)*/
/*printf("%d is %d\n", i, ft_find_next_prime(i));*/
printf("---------------------\n");
// ft_queens();
}
|
