26 lines
705 B
Java
26 lines
705 B
Java
|
|
public class CollatzConjecture {
|
||
|
|
public static int collatzSteps(int n) {
|
||
|
|
int steps = 0;
|
||
|
|
while (n != 1) {
|
||
|
|
if (n - (n / 2) * 2 == 0) {
|
||
|
|
n = n / 2;
|
||
|
|
} else {
|
||
|
|
n = 3 * n + 1;
|
||
|
|
}
|
||
|
|
steps = steps + 1;
|
||
|
|
}
|
||
|
|
return steps;
|
||
|
|
}
|
||
|
|
|
||
|
|
public static int main() {
|
||
|
|
System.out.println(collatzSteps(1));
|
||
|
|
System.out.println(collatzSteps(2));
|
||
|
|
System.out.println(collatzSteps(3));
|
||
|
|
System.out.println(collatzSteps(10));
|
||
|
|
System.out.println(collatzSteps(15));
|
||
|
|
System.out.println(collatzSteps(27));
|
||
|
|
System.out.println(collatzSteps(100));
|
||
|
|
return 0;
|
||
|
|
}
|
||
|
|
}
|