42-Paris/C-Algorithmics-Fundamentals
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Exos

Browse Source
This commit is contained in:
lclerel- lclerel-
2026-03-09 12:38:47 +01:00
commit 9eb566f33b
5 changed files with 386 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

85
ex0/ft_iterative_factorial.c Normal file
View File

@@ -0,0 +1,85 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_iterative_factorial.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lclerel- <lclerel-@learner.42.tech> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/03/09 10:08:57 by lclerel- #+# #+# */
/* Updated: 2026/03/09 12:11:21 by lclerel- ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putnbr(int nb)
{
char value;
if (nb == -2147483648)
{
write(1, "-2147483648", 11);
return ;
}
if (nb < 0)
{
write(1, "-", 1);
nb = -nb;
}
if (nb > 9)
{
ft_putnbr(nb / 10);
}
value = nb % 10 + '0';
}
int ft_iterative_factorial(int nb)
{
int res;
res = 1;
if (nb < 0)
return (0);
if (nb == 0 || nb == 1)
return (1);
while (nb > 1)
{
res = res * nb;
nb--;
}
return (res);
}
/*int main(void)
{
int nb;
write(1, "Test avec factoriel de 5:", 25);
write(1, "\n", 1);
nb = ft_iterative_factorial(5);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec factoriel de 10:", 26);
write(1, "\n", 1);
nb = ft_iterative_factorial(10);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec factoriel de 20:", 26);
write(1, "\n", 1);
nb = ft_iterative_factorial(20);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "(20 depasse l'int limit, resultat negatif)", 42);
write(1, "\n", 1);
write(1, "Test avec factoriel de 0:", 25);
write(1, "\n", 1);
nb = ft_iterative_factorial(0);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec aucune factoriel:", 27);
write(1, "\n", 1);
nb = ft_iterative_factorial(-14);
ft_putnbr(nb);
write(1, "\n", 1);
return (0);
}*/

77
ex1/ft_recursive_factorial.c Normal file
View File

@@ -0,0 +1,77 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_recursive_factorial.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lclerel- <lclerel-@learner.42.tech> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/03/09 09:57:06 by lclerel- #+# #+# */
/* Updated: 2026/03/09 12:15:25 by lclerel- ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putnbr(int nb)
{
char value;
if (nb == -2147483648)
{
write(1, "-2147483648", 11);
return ;
}
if (nb < 0)
{
write(1, "-", 1);
nb = -nb;
}
if (nb > 9)
{
ft_putnbr(nb / 10);
}
value = nb % 10 + '0';
}
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));
}
/*int main(void)
{
int nb;
write(1, "Test avec factoriel de 5:", 25);
write(1, "\n", 1);
nb = ft_recursive_factorial(5);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec factoriel de 10:", 26);
write(1, "\n", 1);
nb = ft_recursive_factorial(10);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec factoriel de 20:", 26);
write(1, "\n", 1);
nb = ft_recursive_factorial(20);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "(20 depasse l'int limit, resultat negatif)", 42);
write(1, "\n", 1);
write(1, "Test avec factoriel de 0:", 25);
write(1, "\n", 1);
nb = ft_recursive_factorial(0);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec aucune factoriel:", 27);
write(1, "\n", 1);
nb = ft_recursive_factorial(-14);
ft_putnbr(nb);
write(1, "\n", 1);
return (0);
}*/

80
ex2/ft_iterative_power.c Normal file
View File

@@ -0,0 +1,80 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_iterative_power.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lclerel- <lclerel-@learner.42.tech> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/03/09 10:22:48 by lclerel- #+# #+# */
/* Updated: 2026/03/09 12:15:33 by lclerel- ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putnbr(int nb)
{
char value;
if (nb == -2147483648)
{
write(1, "-2147483648", 11);
return ;
}
if (nb < 0)
{
write(1, "-", 1);
nb = -nb;
}
if (nb > 9)
{
ft_putnbr(nb / 10);
}
value = nb % 10 + '0';
}
int ft_iterative_power(int nb, int power)
{
int res;
res = 1;
if (power < 0)
return (0);
if (power == 0)
return (1);
while (power > 0)
{
res = res * nb;
power--;
}
return (res);
}
/*int main(void)
{
int nb;
write(1, "Test avec puissance de 5:", 25);
write(1, "\n", 1);
nb = ft_iterative_power(5, 5);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec puissance de 10:", 26);
write(1, "\n", 1);
nb = ft_iterative_power(10, 10);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec puissance de 20:", 26);
write(1, "\n", 1);
nb = ft_iterative_power(20, 20);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "(20 depasse l'int limit, resultat mis a 0)", 42);
write(1, "\n", 1);
write(1, "Test avec puissance de 0:", 25);
write(1, "\n", 1);
nb = ft_iterative_power(0, 0);
ft_putnbr(nb);
write(1, "\n", 1);
return (0);
}*/

72
ex3/ft_recursive_power.c Normal file
View File

@@ -0,0 +1,72 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_recursive_power.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lclerel- <lclerel-@learner.42.tech> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/03/09 10:34:20 by lclerel- #+# #+# */
/* Updated: 2026/03/09 12:15:39 by lclerel- ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putnbr(int nb)
{
char value;
if (nb == -2147483648)
{
write(1, "-2147483648", 11);
return ;
}
if (nb < 0)
{
write(1, "-", 1);
nb = -nb;
}
if (nb > 9)
{
ft_putnbr(nb / 10);
}
value = nb % 10 + '0';
}
int ft_recursive_power(int nb, int power)
{
if (power < 0)
return (0);
if (power == 0)
return (1);
return (nb * ft_recursive_power(nb, power -1));
}
int main(void)
{
int nb;
write(1, "Test avec puissance de 5:", 25);
write(1, "\n", 1);
nb = ft_recursive_power(5, 5);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec puissance de 10:", 26);
write(1, "\n", 1);
nb = ft_recursive_power(10, 10);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec puissance de 20:", 26);
write(1, "\n", 1);
nb = ft_recursive_power(20, 20);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "(20 depasse l'int limit, resultat mis a 0)", 42);
write(1, "\n", 1);
write(1, "Test avec puissance de 0:", 25);
write(1, "\n", 1);
nb = ft_recursive_power(0, 0);
ft_putnbr(nb);
write(1, "\n", 1);
return (0);
}

72
ex4/ft_fibonacci.c Normal file
View File

@@ -0,0 +1,72 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_fibonacci.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: lclerel- <lclerel-@learner.42.tech> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2026/03/09 10:48:57 by lclerel- #+# #+# */
/* Updated: 2026/03/09 12:15:45 by lclerel- ### ########.fr */
/* */
/* ************************************************************************** */
#include <unistd.h>
void ft_putnbr(int nb)
{
char value;
if (nb == -2147483648)
{
write(1, "-2147483648", 11);
return ;
}
if (nb < 0)
{
write(1, "-", 1);
nb = -nb;
}
if (nb > 9)
{
ft_putnbr(nb / 10);
}
value = nb % 10 + '0';
}
int ft_fibonacci(int index)
{
if (index < 0)
return (-1);
if (index == 0)
return (0);
if (index == 1)
return (1);
return (ft_fibonacci(index - 1) + ft_fibonacci(index - 2));
}
/*int main(void)
{
int nb;
write(1, "Test avec index de 5:", 22);
write(1, "\n", 1);
nb = ft_fibonacci(5);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec index de 10:", 23);
write(1, "\n", 1);
nb = ft_fibonacci(10);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec index de -1:", 23);
write(1, "\n", 1);
nb = ft_fibonacci(-1);
ft_putnbr(nb);
write(1, "\n", 1);
write(1, "Test avec index de 30:", 23);
write(1, "\n", 1);
nb = ft_fibonacci(30);
ft_putnbr(nb);
write(1, "\n", 1);
return (0);
}*/