diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-07-09 10:23:25 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-07-09 10:23:25 +0200 |
| commit | 2bc94312042100432ec332abd3c00104d0d095a2 (patch) | |
| tree | 6c60a0fde7b2d8bc984845f6a412171df977e1dc /c05/main.c | |
| parent | 03b4d8a03fb1b2cf93aaac0dc9d317ff9c2ba705 (diff) | |
| download | piscine-2bc94312042100432ec332abd3c00104d0d095a2.tar.gz piscine-2bc94312042100432ec332abd3c00104d0d095a2.tar.bz2 piscine-2bc94312042100432ec332abd3c00104d0d095a2.zip | |
c07/c08 start, c05 faster, better, stronger
Diffstat (limited to 'c05/main.c')
| -rw-r--r-- | c05/main.c | 24 |
1 files changed, 20 insertions, 4 deletions
@@ -32,12 +32,15 @@ int main() 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)); @@ -45,6 +48,8 @@ int main() 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));*/ @@ -53,8 +58,16 @@ int main() 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", 9, 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)); @@ -63,14 +76,17 @@ int main() 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));*/ - /*for (int i = INT_MAX; i > INT_MAX - 100; i--)*/ + 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)); + /*for (int i = INT_MAX; i > INT_MAX - 1000; 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("nextp(%d) = %d\n", 2147483600, ft_find_next_prime(2147483600)); - /*for (int i = INT_MAX; i > INT_MAX - 100; i--)*/ + /*for (int i = INT_MAX; i > INT_MAX - 1000000; i--)*/ /*printf("%d is %d\n", i, ft_find_next_prime(i));*/ } |