Comment on I wish

Rentlar@lemmy.ca ⁨7⁩ ⁨months⁩ ago

private bool isEven(int num) {
if (num == 0) return true;
if (num == 1) return false;
if (num < 0) return isEven(-1 * num);
return isEven(num - 2);
}

• nyoooom@lemmy.world ⁨7⁩ ⁨months⁩ ago

  bool isEven(int num) {
   return num == 0 || !isEven(num - (num > 0 ? 1 : -1));
  }
  

  source

  • Rentlar@lemmy.ca ⁨7⁩ ⁨months⁩ ago

    Damn that’s some solid optimization.

    source
• Johanno@feddit.de ⁨7⁩ ⁨months⁩ ago

  StackoverflowException.

  What do I do now?

  Nvm. Got it.

  if(num % 2 == 0){ int num1 = num/2 int num2 = num/2 return isEven(num1) && isEven(num2)
  }

  if(num % 3 == 0){ int num1 = num/3 int num2 = num/3 int num3 = num/3 return isEven(num1) && isEven(num2) && isEven(num3) }

  Obviously we need to check each part of the division to make sure if they are even or not. /s

  source
• ReluctantMuskrat@lemmy.world ⁨7⁩ ⁨months⁩ ago

  Man I love how horrible this is!

  source
• callyral@pawb.social ⁨7⁩ ⁨months⁩ ago

  …a recursive is-even

  wow

  source