Infallible Code
-
After working at blizzard for 51 years, I finally found an elegant solution by using the power of recursion
private bool IsEven(int number){ if (number > 1) return IsEven(number - 2); if (number == 0) return true; if (number == 1) return false; }assert IsEven(-2); -
After working at blizzard for 51 years, I finally found an elegant solution by using the power of recursion
private bool IsEven(int number){ if (number > 1) return IsEven(number - 2); if (number == 0) return true; if (number == 1) return false; }I removed the tail recursion for you:
private book IsEven(int number) { if(number > 1) return IsEven(number - 2) == true; if(number == 0) return true; if(number == 2) return false; } -
I removed the tail recursion for you:
private book IsEven(int number) { if(number > 1) return IsEven(number - 2) == true; if(number == 0) return true; if(number == 2) return false; }I didn't get this.
Why return
book? Does that have some Blizzard reference?
And why wouldnumber == 2โreturn false? This is a function for gettingtruewhen the number is even, right? -
This post did not contain any content.
Not to take from all the funny answers ... but
bool IsEven(int i) => (i & 1) != 1;(C#)
-
I didn't get this.
Why return
book? Does that have some Blizzard reference?
And why wouldnumber == 2โreturn false? This is a function for gettingtruewhen the number is even, right?wrote on last edited by [email protected]Haha, you're right. I've now learned two things:
- I should not write code on a mobile
- I should not become a proof reader
At the end of the day i just wanted the function to be worse, by causing stack overflows
-
Not to take from all the funny answers ... but
bool IsEven(int i) => (i & 1) != 1;(C#)
Though, obviously I had to come up with some ridiculous solutions:
bool IsEven(int i) => ((Func<string, bool>)(s => s[^1] == 48))($"{i:B}");This one works without conditionals
bool IsEven(int i) { try { int _ = (i & 1) / (i & 1); } catch (Exception) { return true; } return false; } -
This post did not contain any content.
Lol the amount of bullying this guy is getting lately. I've seen similar spins and bends that looks somewhat legit, making people believe he suck at coding
-
This post did not contain any content.
Then again, Duffโs Device works rather similarly.
-
Pah, mathematicians and their generally applicable pure approach to solutions and fancy modulus operations, who needs 'em? Computing is applied and we always work with well-defined finite precision. Granted, writing the boilerplate for all possible 64 bit integers is a bit laborious, but we're programmers! That's what code generation is for.
Granted, writing the boilerplate for all possible 64 bit integers is a bit laborious,
I've been trying to figure out roughly how many lines of code that would equal out to but I've run out of fingers.
-
I worked at Blizzard. I worked at Blizzard. I worked at Blizzard.
Yeah, but did your dad work at Blizzard??
-
At least this madness is isolated to this function. It can easily be fixed.
Pirateโs code is just cluttered with magic numbers everywhere. Hard coded numbers that are referring to a big โstory arrayโ, or characters. Itโs just a giant web of complexity. The only fix is to start from scratch.
It's simple. The only problem is that your code sucks!
-
Though, obviously I had to come up with some ridiculous solutions:
bool IsEven(int i) => ((Func<string, bool>)(s => s[^1] == 48))($"{i:B}");This one works without conditionals
bool IsEven(int i) { try { int _ = (i & 1) / (i & 1); } catch (Exception) { return true; } return false; }s[^1]
Ohh wow, I've been learning it casually for years, and I didn't know that existed in C#. I guess I should go back and hit the books some more.
-
If small numbers are much more frequent, it's better to return early. Really, you should gather statistics about the numbers the function is called with, and put the most frequent ones at the top.
-
The fuck is that
-
Granted, writing the boilerplate for all possible 64 bit integers is a bit laborious,
I've been trying to figure out roughly how many lines of code that would equal out to but I've run out of fingers.
Ah, common issue. When that happens, you just start using your toes.
-
Yeah, but did your dad work at Blizzard??
Iโm the first ever second generation Blizzard employee!
-
Definitely a vibe.
wrote on last edited by [email protected]The only way I could see that happening is if enough people poisoned the data to do this
-
assert IsEven(-2);Now see, you need the other method. IsNegativeEven()
-
This post did not contain any content.
Even plus even equals even.
Odd plus odd equals even.
Only odd plus even makes an odd.
Are there twice as many even numbers as there are odd numbers?
-
The fuck is that
Okay so basically this is saving bytes on a technicality but also good programming language design (for this specific purpose).
The first aspect is that since you're scored on bytes, it's not really to your advantage to use a language that uses ascii (or utf-8) for it's tokens, because a large part of it is unprintables like DEL or BELL. So people have designed specially crafted golfing programming languages that use a full 256 possible characters in order to pack as many features as possible in as few bytes as possible.
The good design part of it is that if you really think about it hard, there's really not that many things you expect a programming language to do. It turns out that 256 total different operands is about in the sweet spot, so each character that's available in the 1-byte code page is mapped to one command, and the languages are also designed to make as many things as possible implicit, both at the cost of readability. Remember, all that matters here is getting the lowest score, not code maintainability or anything else.
This leads to languages like japt (which is a terse form of JavaScript, I'm pretty sure) or pyth (same for python) or Vyxal (my personal favorite, used to be python based but is now bespoke) that look like this but absolutely own at getting a task out in as few bytes as possible.
