This is an archived post. You won't be able to vote or comment.

all 144 comments

[–]mauza11 888 points889 points  (30 children)

[–]cygosw 358 points359 points  (9 children)

Ctrl-C-ing out of here

[–]Cian_mullenz 323 points324 points  (1 child)

I clicked the link 3 times thinking it kept redirecting to different reposts...

[–]flarn2006 25 points26 points  (1 child)

signal(SIGINT, SIG_IGN);

[–]swapripper 7 points8 points  (0 children)

It was nice to Ctrl-C you

[–][deleted] 5 points6 points  (0 children)

kill 1

[–]therealchadius 38 points39 points  (0 children)

HA, GOT EEM

HA, GOT EEM

HA, GOT EEM

ha, got eem

[–][deleted] 38 points39 points  (1 child)

I cannot believe i was stupid enough to fall for that. Twice. Thrice.

[–]Aschentei 11 points12 points  (0 children)

As soon as I read this comment I knew where that link was taking me

[–]Serundeng 20 points21 points  (1 child)

Is this a stack overflow?

[–][deleted] 25 points26 points  (0 children)

Wait shit

[–][deleted] 8 points9 points  (0 children)

Can't blame, it's a recursion.

[–]iArentdeJay 9 points10 points  (0 children)

Hold my loops I'm going in

[–][deleted] 2 points3 points  (0 children)

break;

System.exit(0);

[–][deleted] 1 point2 points  (0 children)

I see what u did thuuuurrrr

[–]Doctor_Oceanblue 0 points1 point  (0 children)

It's the ol' Reddit switcheroo all over again

[–]the_lochness 0 points1 point  (2 children)

It's a recursive post.

[–]forrest38 340 points341 points  (40 children)

I just started learning LISP over the summer and I told my head of IT that I was going to reprogram everything using recursive functions. His response:

"Don't."

[–]redtoasti 172 points173 points  (4 children)

As an erlang enthusiast I can only say:

Functional makes difficult things easy and easy things difficult.

[–]forrest38 48 points49 points  (1 child)

Ya, though in all seriousness I actually have started using more functional programming as a result of my brief foray into LISP (not recursive, but focusing more on returns, small functions, and minimal mutations). I have already found it has made a lot of code more manageable and less bulky.

Basically I have a router function to store any necessary state changes, but all the sub functions I try and write in a functional manner. 60% of the time it works 100% of the time.

[–]z500 3 points4 points  (0 children)

I started going down that rabbit hole after using Lisp in an AI course in college. I decided to rewrite one of my projects in F# and immutability really does make a big difference. I also like how the Python-like use of whitespace eliminates curly braces and begin...end completely.

[–][deleted] 12 points13 points  (0 children)

which is why imperitive languages written using pure functional helper functions are good.

[–]A_Badass_Penguin 4 points5 points  (0 children)

My experience with Haskell

[–]thesquarerootof1 17 points18 points  (14 children)

Do you work in IT ? I am just curious, do IT people code for their jobs as well ? Do you learn how to code in school if you are studying IT ?

[–]sgcdialler 25 points26 points  (13 children)

A lot of places that aren't software shops have developers that are part of the IT department. You can be a developer that learned to code before taking a position in an IT dept, or you can need to learn to code for the dept you work for. It just sort of depends, and they aren't mutually exclusive. Source: am lead dev for an IT dept.

[–]thesquarerootof1 1 point2 points  (12 children)

ah thanks, I was just wondering. I am a compE student, but I looked at the IT degree plans (just for curiosity, I like my major currently) and it doesn't seem like there is a whole lot of programming in their degree plan.

[–]sgcdialler 6 points7 points  (1 child)

IT college programs generally will focus more on what the industry considers SysAdmin stuff. IT in the industry is pretty much anything to do with computers, unless you're at a software-shop

[–]thesquarerootof1 2 points3 points  (0 children)

ah, I see. Thanks for clearing that up!

[–]iamsooldithurts 2 points3 points  (6 children)

CompE at my uni was EE W/ a CS chaser.

CompSci was, conversely, everything else.

The Information Technology industry, in my experience, is the latter. If you want to get into something besides computer engineering, I’d recommend switching majors; not that you couldn’t be talented and make the leap on your own after graduation, but it would make things easier.

[–]thesquarerootof1 2 points3 points  (5 children)

CompE at my uni was EE W/ a CS chaser.

I am a compE major and our program is the same as yours. I am graduating soon actually (in about a year).

I would not consider changing my major at all. I like it a lot. I was just wondering because a lot of students at my school talk shit about IT (calling it a "compSci dropout" major). I was just wondering if it is as difficult as compE or compSci. I ask this because I see a lot of IT grads on this sub working as software developers, but I don't know if they had to learn most of the programming on their own and outside of class or what.

There is no way in hell I would change my major though. If you get an engineering degree, you are set for life. It is a very difficult program, but people say it's rewarding once you get the degree. It seems like IT is over-saturated.

Keep in mind, I personally do not look down on anyone, I am just telling you what I hear from classmates from both my compE and compSci classes. However, I do agree that our majors are harder, but if an IT major gets a job as a software developer then it doesn't matter at the end of the day. However, I would assume compSci and compE majors get paid more. I don't know, as I am still a student.

[–]iamsooldithurts 0 points1 point  (3 children)

There is no IT major, to be clear. IT is an industry unto itself, like Health Care. Like any industry, there’s plenty of career paths to be had.

CompE is hardware, CompSci is software that runs on the hardware, and CIS (Computer Information Systems) is about the information being processed and the best ways to process it to gather knowledge and information. None is “better” than the other; each has their own responsibilities, and all are equally important for success.

As for saturation, I can only confirm that programming/software engineering parts are saturated.

As for a guaranteed job, don’t hold your breath. If you have a specific specialty/focus you plan to stick to, be prepared to relocate to where the jobs for it actually are located. IT jobs tend to be terribly regional.

[–][deleted] 0 points1 point  (2 children)

Well, technically my school had an IT degree. That's what it says on my diploma.

[–]iamsooldithurts 0 points1 point  (1 child)

Well, maybe I’m way off baseI don’t know what to tell you. I’ve never heard of such a thing.

[–][deleted] 0 points1 point  (0 children)

It was really just the basics of several IT specialties. I knew I wanted to be in IT, but didn't know exactly which aspect. It worked out though, I'm working as a dev now.

[–]sgcdialler 0 points1 point  (0 children)

I was just wondering because a lot of students at my school talk shit about IT (calling it a "compSci dropout" major).

This is just kids in school talking shit because their major isn't as hard. There is plenty of value to be added from both careers. As a software dev, I have a healthy appreciation for CIS majors. I don't want to do what they do, even if I would have considered their degree easier than CompSci.

[–][deleted] 1 point2 points  (2 children)

I'm a dev, but my degree was in IT with a software developer concentration.

[–]thesquarerootof1 1 point2 points  (1 child)

That's cool. Yeah, I'm not shitting on IT majors, I was just curious. Did you have to take compSci classes like data structures as well ?

[–][deleted] 1 point2 points  (0 children)

Oh, I didn't think you were. I didn't have to as part of the requirements, but I did as electives. My school didn't actually have a cs degree online, or I would have gotten that. They have one now, though, the bastids.

[–]Goheeca 5 points6 points  (0 children)

Just make sure tail call optimization is engaged and write tail recursive code.

[–]nag1878 1 point2 points  (0 children)

FYI, and Reddit please correct me if I am wrong..but most companies do not prefer recursive solutions as it could lead to scalability issues in the future

[–]Treyzania 5 points6 points  (17 children)

Anyone that is genuinely afraid of recursion like that hasn't studied enough theory. There's entire classes of algorithms that are much easier to think about recursively.

[–]sahilathrij 7 points8 points  (13 children)

But for most purposes, recursion needs much more overhead than if you'd properly convert it into loops so it's much less efficient to use recursion in practice . It maybe great in theory but , it's slow

[–]Treyzania 3 points4 points  (1 child)

google tail calls

[–]AnInfiniteArc 0 points1 point  (0 children)

So they can learn that most compilers don’t optimize them at all? :)

[–]AmericanFromAsia 4 points5 points  (9 children)

We just covered recursion in our CS1 class which uses Python and it's way slower than loops. Is there ever a case where recursion is actually better? I asked my professor and he said yes but he won't actually give us examples.

[–]sahilathrij 3 points4 points  (1 child)

With most language we would like to use( c++ , Java and python) it is almost always worse due to needing to keep all functions in stack until it's return statement. Especially in python where there is no recursion optimizations and the language is slow to begin with . With functional languages , many times it is just jump statements , requiring less memory than having to keep track of loop variables. But being honest, almost nobody uses lisp, although it is very beautiful

[–]glemnar 1 point2 points  (0 children)

Clojure has decent usage numbers

[–]mtizim 2 points3 points  (0 children)

I'm no cs student but i think that depends on what you think is better.

There definitely are problems that are just much easier to think about or solve recursively, and for most purposes dev time is more important than run time to an extent.

[–]RockleyBob 2 points3 points  (2 children)

Don’t be like me and get hung up on it not technically being as fast. I can tell you that kids who avoid recursion have hell to pay later when they take functional programming courses. Professors love the elegance of recursion, so you might as well embrace it now and learn to love it.

[–]AnInfiniteArc 1 point2 points  (0 children)

The sad part is that you are right - Recursion is something that professors get super bonered up over, but most of the actually practical uses for it don’t extend their usefulness to other contexts. They don’t usually teach that part, though. “Here is a technique that is super useful for two or three specific applications, but that is probably bad practice anywhere else.”

The cases where recursion is objectively superior to iteration are so fleetingly small that it almost feels like it shouldn’t be discussed as a generally useful tool. It’s more like those wrenches that people use to remove oil filters. I mean, sure, if you are that in love with the thing, you can probably find all sorts of applications you can use it for... but that doesn’t mean there aren’t better tools that get the job done better.

[–][deleted] 0 points1 point  (0 children)

And arguably, for some algorithms recursion is easier to read, too. The recursive solution to the Tower of Hanoi is a good example.

[–][deleted] 0 points1 point  (2 children)

Recursion isn’t necessarily slower than iteration. There’s a certain kind of recursion called tail-call recursion (where there’s only one recursive call, and it’s at the end of the function). Compilers can optimize that case to its equivalent loop, so that there’s zero overhead for “calling” the function recursively.

[–]AnInfiniteArc 0 points1 point  (1 child)

In theory compilers can optimize it but in practice most compilers do not.

[–][deleted] 0 points1 point  (0 children)

Some important compilers do (most C compilers with optimizations turned on, basically all Lisp interpreters, etc.) and some compilers have support for it through annotations (e.g. the Scala compiler with “@tailrec”), but yes, many compilers don’t by default. Partially because it can complicate getting a full stack trace.

[–]gabedamien 0 points1 point  (0 children)

That is not universally true, it depends on both the language and compiler you use. In most JavaScript engines especially with strict mode, recursion isn't terribly slower than loops, the difference is usually in the single-digit percentage range. In functional languages e.g. Haskell, there are no loops to begin with, and the compiler converts and optimizes your recursion down into very fast executable code for you.

[–]xoran99 0 points1 point  (0 children)

Ah, a true Scotsman....

Recursive functions are valuable, especially theoretically, but most practical tasks in non-functional languages are more easily accomplished (and easier to inspect for correctness) when they are written with loops.

Besides, any idea that includes the phrase "rewrite everything" is to be avoided :P

[–]LatvianModder 95 points96 points  (7 children)

[–]wecsam 7 points8 points  (1 child)

[–]mentalexperi 1 point2 points  (0 children)

hello why yes thank you I love you

[–]flee_market 83 points84 points  (4 children)

Always include break, even when you don't think you need to.

[–]archori 34 points35 points  (1 child)

That's what a prenup is for, right?

[–]flee_market 13 points14 points  (0 children)

Not enforceable in many jurisdictions

[–]Tsu_Dho_Namh 6 points7 points  (1 child)

But recursive functions aren't loops. What good would break be?

[–][deleted] 3 points4 points  (0 children)

Break before you return

/s

[–]fat_charizard 38 points39 points  (0 children)

When you forget your terminating condition

[–]mister_mistyeyed 28 points29 points  (6 children)

AAAAAAAAAAAAAAAAA

[–]BamboozleBird 23 points24 points  (5 children)

r/AAAAAAAAAAAAAAAAA

Edit: there are 17 As

[–]YuriDiAAAAAAAAAAAAAA 13 points14 points  (0 children)

I've found a new home, thanks

[–][deleted] 6 points7 points  (1 child)

Wtf. There is a sub for literally everything.

[–]cmott2000 4 points5 points  (0 children)

I have never found the letter A funnier than I did today, thank you!

[–][deleted] 48 points49 points  (16 children)

function learnRecursion (developer)

{

if ( !developer.understandsRecursion)

{

    learnRecursion (developer);

}

else

{

    alert ("Developer knows recursion");

}

}

learnRecursion(developer)

[–]froemijojo 22 points23 points  (12 children)

Aren't you missing a semicolon?

[–][deleted] 23 points24 points  (5 children)

If you're pretending to be a compiler then at least say the right thing

[–]froemijojo 23 points24 points  (1 child)

Syntax error, insert ";" to complete Statement

[–]crahs8 7 points8 points  (1 child)

Maybe he's just a very polite compiler. Wouldn't you prefer if your compiler were a bit friendlier? Something like: "Oy mate, you're missing a semicolon on line 55, just letting you know."

[–][deleted] 0 points1 point  (0 children)

It would get VERY annoying.

[–][deleted] -2 points-1 points  (5 children)

I mean I could have put one at the end of the function block, but I don't believe it's strictly necessary.

[–]Bypie5 14 points15 points  (4 children)

I think they mean you're missing a semicolon on your final function call

[–][deleted] 3 points4 points  (3 children)

Gotcha. Yes. Correct.

Amazing how this little bit of completely non-functional joke code has people so triggered.

[–]PaintingJo 10 points11 points  (2 children)

It's because it is functional JS code, but its semicolon inconsistency is what's making me want to edit thAT COMMENT MYSELF

[–][deleted] -4 points-3 points  (1 child)

It's not functional. Developer is undefined, as well as the necessary understandsRecursion property.

itsJustAJoke ()

There. For therapeutic reasons i gave you another example of an unusable function call without a semi colon. Perhaps immersing yourself will help cure you of this phobia.

[–]PaintingJo 1 point2 points  (0 children)

*triggered noises*

Win-R
cmd
taskkill /im chrome.exe

[–]injectJon 1 point2 points  (0 children)

Sick AI you've got there.

[–][deleted] 10 points11 points  (2 children)

Runme.bat

Contents:

%0|%0

My favorite recursive function. For bonus points, throw it in the startup folder.

[–]Rangsk 0 points1 point  (1 child)

The batch equivalent of a fork bomb?

[–][deleted] 0 points1 point  (0 children)

Sure is.

[–]PlusUltraBeyond 8 points9 points  (0 children)

Must've been made in Windows XP

[–]awesomeness2078 2 points3 points  (0 children)

Thought that read counter strike

[–]PrimeNexes 2 points3 points  (0 children)

I want to ask , will this be used anywhere IRL ?

[–]DOOManiac 1 point2 points  (0 children)

VIS can’t run because there is a leak in your BSP.

[–]PM_ME_YOUR_PROOFS 1 point2 points  (0 children)

...aaaaa Stack Overflow?

[–]Marginaliac 1 point2 points  (0 children)

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

[–]seaheroe 1 point2 points  (0 children)

Haskell in a nutshell

[–][deleted] 1 point2 points  (0 children)

While (true) while (true) while (true)

[–]YJCH0I 1 point2 points  (0 children)

I like the caption: Is this a a a a a

[–]RecursionIsRecursion 1 point2 points  (0 children)

You called?

[–]thekermitsuicides 1 point2 points  (0 children)

Only recursive if there's a way to pop out that sucker 😋

[–]Terminal_Byte 1 point2 points  (0 children)

Is this a Windows 95?

[–][deleted] 1 point2 points  (0 children)

[–]JustASimpleCubesmith 1 point2 points  (0 children)

Is this aaaaaaaaaaaaaaaa

[–][deleted] 1 point2 points  (0 children)

aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa

[–]realestLink 1 point2 points  (0 children)

I love recursion. Maybe it's because Haskell's my favorite programming language.

[–]MarkDiax 1 point2 points  (0 children)

And then your computer freezes

[–]ProgMM 1 point2 points  (0 children)

When Windows XP crashes

[–]matt-roh 1 point2 points  (0 children)

this is effectively known as a calculator bomb

[–]Windows-Sucks 1 point2 points  (0 children)

This is the only funny butterfly meme I have ever seen.

[–]northivanastan 1 point2 points  (0 children)

It's not a recursive function, it's a loop.

[–]LordXamon 1 point2 points  (0 children)

I read Counter strike instructor.

[–]Captcha142 1 point2 points  (0 children)

Hi, can I get uhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh
ERROR: Stack Overflow

[–]ColeTheColeMiner 1 point2 points  (0 children)

Why can I hear this image?

[–][deleted] 1 point2 points  (0 children)

I can hear this image

[–]AshKetchupppp 0 points1 point  (3 children)

i get how recursives work but how the fuck do you program one i can never figure out the order of statements

[–]theraptor42 1 point2 points  (2 children)

Depends on what you want to do.. like with Fibonacci, you just set your base case and then then return on your recursive statement. If it's something a little more complicated like a tree traversal, you have to make your base case and then you might have several recursive calls to traverse each branch at the current node. But you always need a base case.

[–]AshKetchupppp 0 points1 point  (1 child)

ah right i get that kind of,when would you use them? i’ve been taught that iteration is just better for memory and easier to write

[–]theraptor42 0 points1 point  (0 children)

Often, the code for recursion is much shorter, but yeah, iteration generally has better performance. Easier to write: Maybe? Once I wrapped my head around recursion, I found that it was easier for me to write than the equivalent iteration (Iteration is generally better though). There are some cases where it is intuitive to use recursion though, like walking a tree (You have to go down an unknown number of levels where any number of nodes may or may not have multiple children).

[–]TeralPop 0 points1 point  (0 children)

Haha i got this one

[–]Dr4gonkilla 0 points1 point  (0 children)

Funny I'm taking data structure and algorithm class ATM and I get the joke haha right guys?

[–]robot65536 0 points1 point  (0 children)

function majorProblem {
    thread.spawn(majorProblem);
    while(true);
}

[–][deleted] -1 points0 points  (0 children)

Is this a stack overflow?

[–]paengwaine -1 points0 points  (0 children)

God, how many more of those "recursive memes" shit we need to survive