$1$ Problem Statement

Write a Java program that reads in a list of numbers, and sorts

them according to the number of steps they follow in the Collatz

sequence before reaching $1($most steps comes first$).$ A Collatz

sequence starts with a given number and follows the operation

below until reaching $1$ :

If the number is even, divide it by two.

If the number is odd, triple it and add one.

State the Big$-$O complexity of the algorithm you have written,

and explain what this means in your own words.

Sample Input

Sample Output

$6$

$8$

$2$

Explanation

$15...($takes $17$ steps to reach $1)$

$..(takes8$ steps $to$ reach $1)$