48 lines
1.2 KiB
C
48 lines
1.2 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* ft_is_prime.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: whaffman <whaffman@student.codam.nl> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2024/06/13 12:20:04 by whaffman #+# #+# */
|
|
/* Updated: 2024/06/13 12:39:01 by whaffman ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include <stdio.h>
|
|
|
|
int ft_is_prime(int nb)
|
|
{
|
|
int i;
|
|
|
|
if (nb < 2)
|
|
return (0);
|
|
i = 2;
|
|
while (i * i <= nb)
|
|
{
|
|
if (nb % i == 0)
|
|
return (0);
|
|
i++;
|
|
}
|
|
return (1);
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
|
|
int main(void)
|
|
{
|
|
int i;
|
|
|
|
i = -3;
|
|
while (i < 100)
|
|
{
|
|
if (ft_is_prime(i))
|
|
printf("ft_is_prime(%d) = %d\n", i, ft_is_prime(i));
|
|
i++;
|
|
}
|
|
return (0);
|
|
}
|
|
|
|
#endif
|