Calculate steps to reach 1 ? Need to look up Google and find the similar problem.

CalculateSteps.cs

/*
Problem statement:
f(n) = { 3n + 1 if n is odd
       { n/2    if n is even
Given n value 3, it will take 8 steps to reach 1. (?)       
3 > 10 > 5 > 16 > 8 > 4 > 2 > 1 = run length = 8
*/

public int getSteps(int n) 
{
  if(n == 1) {
   return 1;
  }
  
  return 1 + (n % 2 == 0) ? getSteps(n /2) : getSteps(3*n + 1);
}