@nave@lemmy.zip to Lemmy Shitpost@lemmy.worldEnglish • 2 years agoI wishi.imgur.comimagemessage-square169arrow-up1890
arrow-up1890imageI wishi.imgur.com@nave@lemmy.zip to Lemmy Shitpost@lemmy.worldEnglish • 2 years agomessage-square169
minus-squareRentlarlinkfedilink103•edit-22 years agoThey call me a StackOverflow expert: 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); }
minus-squarenyoooomlinkfedilink33•2 years agobool isEven(int num) { return num == 0 || !isEven(num - (num > 0 ? 1 : -1)); }
minus-squareJohannolinkfedilink16•edit-22 years agoStackoverflowException. 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
They call me a StackOverflow expert:
bool isEven(int num) { return num == 0 || !isEven(num - (num > 0 ? 1 : -1)); }
Damn that’s some solid optimization.
StackoverflowException.
What do I do now?
Nvm. Got it.
Obviously we need to check each part of the division to make sure if they are even or not. /s
…a recursive is-even
wow