Collatz Steps (while)

Starting from n = 6, count how many steps it takes to reach 1 using the Collatz rule: if n is even, halve it; if n is odd, replace it with 3 * n + 1. Count each transformation. Then print:

Steps: 8

The path is 6 -> 3 -> 10 -> 5 -> 16 -> 8 -> 4 -> 2 -> 1, which is 8 steps.

Expected Output:

Steps: 8

Topics:

Loops

Code Editor

Tab to indent · Ctrl+Enter to run · Ctrl+Space to expand shortcuts (sysout, psvm, fori)

Your Output

Run your code to see the output here...

Test Cases

Run your code to see test case results.