We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent f1eeff9 commit 9dd1aedCopy full SHA for 9dd1aed
0x04-more_functions_nested_loops/100-prime_factor.c
@@ -0,0 +1,39 @@
1
+#include <stdio.h>
2
+
3
+/**
4
+ * prime_factor - finds and prints the largest prime factor.
5
+ *
6
+ * @number: the number to be processed.
7
8
+ * Return: Nothing.
9
+ */
10
+void prime_factor(long int number)
11
+{
12
+ long int i;
13
+ for (i = 2; i <= number; i++)
14
+ {
15
+ if (i == number)
16
17
+ printf("%ld\n", number);
18
+ break;
19
+ }
20
21
+ if (number % i == 0)
22
23
+ prime_factor(number / i);
24
25
26
27
+}
28
29
30
+ * main - entry point.
31
32
+ * Return: Always Success (0).
33
34
+int main(void)
35
36
+ long int number = 612852475143;
37
+ prime_factor(number);
38
+ return (0);
39
0 commit comments