c05/c06 normed, c07/c08 begining

8 files changed, 20 insertions, 22 deletions

diff --git a/c05/ex00/ft_iterative_factorial.c b/c05/ex00/ft_iterative_factorial.c
index fa64f59..3773b9d 100644
--- a/c05/ex00/ft_iterative_factorial.c
+++ b/c05/ex00/ft_iterative_factorial.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 16:48:21 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 17:14:26 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:06:59 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_iterative_factorial(int nb)
+int	ft_iterative_factorial(int nb)
 {
 	int	acc;
 	int	i;
diff --git a/c05/ex01/ft_recursive_factorial.c b/c05/ex01/ft_recursive_factorial.c
index 615cd04..288e61f 100644
--- a/c05/ex01/ft_recursive_factorial.c
+++ b/c05/ex01/ft_recursive_factorial.c
@@ -6,15 +6,15 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 17:15:10 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 17:18:58 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:07:48 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_recursive_factorial(int nb)
+int	ft_recursive_factorial(int nb)
 {
 	if (nb < 0)
 		return (0);
 	if (nb == 0 || nb == 1)
 		return (1);
-	return nb * ft_recursive_factorial(nb - 1);
+	return (nb * ft_recursive_factorial(nb - 1));
 }
diff --git a/c05/ex02/ft_iterative_power.c b/c05/ex02/ft_iterative_power.c
index ccfd359..af26b08 100644
--- a/c05/ex02/ft_iterative_power.c
+++ b/c05/ex02/ft_iterative_power.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 17:20:15 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 17:39:06 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:06:24 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_iterative_power(int nb, int power)
+int	ft_iterative_power(int nb, int power)
 {
 	int acc;
 
diff --git a/c05/ex03/ft_recursive_power.c b/c05/ex03/ft_recursive_power.c
index 94c4fbd..8339768 100644
--- a/c05/ex03/ft_recursive_power.c
+++ b/c05/ex03/ft_recursive_power.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 17:39:43 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 19:32:17 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:07:33 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_recursive_power(int nb, int power)
+int	ft_recursive_power(int nb, int power)
 {
 	if (power < 0)
 		return (0);
@@ -18,5 +18,5 @@ int ft_recursive_power(int nb, int power)
 		return (1);
 	if (power == 1)
 		return (nb);
-	return nb * ft_recursive_power(nb, power - 1);
+	return (nb * ft_recursive_power(nb, power - 1));
 }
diff --git a/c05/ex04/ft_fibonacci.c b/c05/ex04/ft_fibonacci.c
index 66ff9b1..92da477 100644
--- a/c05/ex04/ft_fibonacci.c
+++ b/c05/ex04/ft_fibonacci.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 19:34:02 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 19:37:37 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:08:19 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_fibonacci(int index)
+int	ft_fibonacci(int index)
 {
 	if (index < 0)
 		return (-1);
@@ -18,5 +18,5 @@ int ft_fibonacci(int index)
 		return (0);
 	if (index == 1 || index == 2)
 		return (1);
-	return ft_fibonacci(index - 1) + ft_fibonacci(index - 2);
+	return (ft_fibonacci(index - 1) + ft_fibonacci(index - 2));
 }
diff --git a/c05/ex05/ft_sqrt.c b/c05/ex05/ft_sqrt.c
index 8a86489..a72af2d 100644
--- a/c05/ex05/ft_sqrt.c
+++ b/c05/ex05/ft_sqrt.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 20:06:48 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/06 20:11:19 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:08:36 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_sqrt(int nb)
+int	ft_sqrt(int nb)
 {
 	int	i;
 
diff --git a/c05/ex06/ft_is_prime.c b/c05/ex06/ft_is_prime.c
index 05628a2..dc06fa5 100644
--- a/c05/ex06/ft_is_prime.c
+++ b/c05/ex06/ft_is_prime.c
@@ -6,11 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/06 20:17:59 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/07 08:27:21 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:08:46 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-int ft_is_prime(int nb)
+int	ft_is_prime(int nb)
 {
 	int	i;
 
diff --git a/c05/ex07/ft_find_next_prime.c b/c05/ex07/ft_find_next_prime.c
index a83f308..e17ca94 100644
--- a/c05/ex07/ft_find_next_prime.c
+++ b/c05/ex07/ft_find_next_prime.c
@@ -6,12 +6,11 @@
 /*   By: cacharle <charles.cabergs@gmail.com>       +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/07/07 07:50:11 by cacharle          #+#    #+#             */
-/*   Updated: 2019/07/07 08:29:02 by cacharle         ###   ########.fr       */
+/*   Updated: 2019/07/08 12:09:16 by cacharle         ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
-
-int is_prime(int nb)
+int	is_prime(int nb)
 {
 	int	i;
 
@@ -31,10 +30,9 @@ int is_prime(int nb)
 	return (1);
 }
 
-int ft_find_next_prime(int nb)
+int	ft_find_next_prime(int nb)
 {
 	while (!is_prime(nb))
 		nb++;
 	return (nb);
 }
-