@[email protected] to Lemmy [email protected]English • 1 year agoI wishi.imgur.commessage-square183fedilinkarrow-up1906
arrow-up1888imageI wishi.imgur.com@[email protected] to Lemmy [email protected]English • 1 year agomessage-square183fedilink
minus-squareRentlarlinkfedilink105•edit-21 year 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-squarenyoooomlinkfedilink34•1 year agobool isEven(int num) { return num == 0 || !isEven(num - (num > 0 ? 1 : -1)); }
minus-squareJohannolinkfedilink16•edit-21 year 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
Man I love how horrible this is!
…a recursive is-even
wow