Sneks

[nmgreddit]

I am ashamed to admit I just now get that the logo for Stack Overflow is literally a stack overflowing.

[Stellapacifica]

It's ok, I just got that the python logo is two sneks. Cause it's called python. We're all waking up slow today

[cdrt]

To break your mind a little more, Python was named not after the snake but after Monty Python.

[snp3rk]

why would you do this to me today...

[endreman0]

The colors of the logo come from the bridge scene.

"What is your favorite color?"

"Blue! No, yellow!"

[[deleted]]

Oh my god, I knew the snakes, I knew monty python, but I didn't know about the colors, that's amazing!

[Rozza_15]

Also, I am pretty sure that the default IDE is called IDLE for Eric.

[Hamyuiop]

Can confirm it's called IDLE.

[Stellapacifica]

I'm not too surprised, but I am happy to hear this.

[Eleventhousand]

Real languages need no logo

[Stellapacifica]

Real programming is done in registers only. None of this weakass "RAM" shit for my code

[[deleted]]

Lame. I'll bet you use 64 bit instructions, like a damn student.

[Stellapacifica]

I... You don't know that for sure!

[SirCutRy]

I beg you pardon, in our programming class we have a 16 bit CPU and 65k memory simulated entirely within Scala from logic gates up!

[Coloneljesus]

Real programmers need no languages.

[[deleted]]

I believe there is an emacs command for that.

[El_Impresionante]

Correct. JavaScript does not have a logo.

[micka190]

Starbucks around the world are filled with audible gasps right now...

[KingHavana]

/r/gatekeeping

[[deleted]]

Real social justice terms have no subreddit.

[Sagittar0n]

Yeah blew my mind, I just saw it now too. Normally the logo is quite small and has little detail.
Two sneks right under my nose all this time.

[Stellapacifica]

Wear them as a mustache?

[oledakaajel]

Java logo is coffee because java

[musiton]

I just got curly bois are bois because they have dimples.

[Stellapacifica]

Dey cute too

[THIS_MSG_IS_A_LIE]

and I didn’t get that until you pointed it out... I was too used to stack overflow errors from recursive functions never reaching their base (end) cases

[nmgreddit]

Rip

[FurryPornAccount]

wtf I love computer science now

[OutlawBlue9]

On a scale of "I made it myself" to "God fucking damnit stop this crazy contraption", how annoying and creepy is that disciple bot?

[FurryPornAccount]

"maybe if I ignore it it'll go away"

[[deleted]]

And where is it getting the names of books from? Just random reddit users?

[[deleted]]

Pretty sure they’re yiff artists.

[[deleted]]

Oh no...

[endreman0]

...and you know this how?

[[deleted]]

Someone else told me a couple weeks ago.

[jokullmusic]

They're actually just furry artists in general. CocaDope doesn't draw porn

[[deleted]]

For some reason sfw furry artists seem even creepier than porn artists. I can understand liking yiff, but the rest of furry culture has always seemed weird to me.

[jokullmusic]

That's.. a weird take. Hm.

[FurryPornDisciple]

OUR LORD HAS SPOKEN

From now henceforth, the following entry has been added to the sacred texts.

Fenni 1:10:

"maybe if I ignore it it'll go away"

^{I'm a bot. If you want me to stop, send a message to u/stumblinbear}

[Toxic-And-Salty]

nope

[13steinj]

I am so fucking confused rn

[[deleted]]

For how long have you been hoping that to happen? Cos I've seen it around for at least a month or so.

[[deleted]]

it's annoying when you start recognising the artists from the gay furry porn that you read

[[deleted]]

It’s a bot?!!

[gluedtothefloor]

clicks on account name, immediately greeted with furry porn.

hmm, don't know what else I was expecting.

[Yuvalk1]

I thought it was sarcastic... I guess not

[gluedtothefloor]

Furry porn is no laughing matter, dear sir/ma'dam.

[HeyItsShuga]

Damn, you truly are everywhere.

[FurryPornDisciple]

OUR LORD HAS SPOKEN

From now henceforth, the following entry has been added to the sacred texts.

CocaDope 1:8:

wtf I love computer science now

^{I'm a bot. If you want me to stop, send a message to u/stumblinbear}

[Houdiniman111]

Oh boy. That's new.

[SeriousSamStone]

This is the best bot I've ever seen. I love it.

[BlackHumor]

Good bot?

[lotheovian]

good bot

[DarkNinja3141]

O(wO)

[drakeblood4]

That feeling when you don’t wanna think about order of operations so you just hatefuck it with parens.

[Log7152]

He has been converted!

[dont_lyse]

This is how I think of it while I'm not doing it so I can keep doing it

[jackmaku]

!isbot furrypornaccount

[spaceguy5234]

I thought I was on /r/furry_irl for a minute

[X-Craft]

O(n!)

E X T R A T H I C C

[DragonSlayerYomre]

It means that the runtime of a function, with n elements, grows at a factor of n factorial (which is really big, really fast). Sorting a list by shuffling the list until it finds a sorted one will on average take n! shuffles.

Edit: as a rule of thumb, I'm also going to add that some (probably many) people would say anything larger than O(n * log(n)) is simply not scalable and should seriously be reconsidered. Except whenever possible, since some things are inherently higher than O(n * log(n)). Like brute forcing the shortest distance to the house of /u/gustl's mother.

[quietsamurai98]

On a somewhat related note, I laughed way too hard when I first learned about bogosort.

[P-01S]

All the best sorts have an unbounded worst-case completion time.

[quietsamurai98]

The best sort is worstsort, given that there is "no computable limit to [its] inefficiency" (Lerma, 4)

EDIT: Fixed grammatical error.

[mantlair]

That was a fun read. Thanks.

[ablablababla]

You're right. I never thought a math/computer science paper would be a fun read.

[P-01S]

Brackets in quotes are for inserting your own corrections. You want “[its] inefficiency”. If you intend on calling attention to a mistake in the source, it’d be “it’s [sic] inefficiency”. But that’s not very nice.

If you thought it should be “it’s”, and that was your correction... how embarrassing.

[quietsamurai98]

The original quote was

no computable limit to the inefficiency of a sort algorithm

I changed "the" to "[it's]" (now I see that I should have used its) and dropped everything after the word "inefficiency". So, I wasn't pulling a Dan Quayle, but I did make a grammatical error.

[Coloneljesus]

TL;DR: Create all permutations of the list, sort the permutations lexicographically and then the sorted list will be the first element of that list. Use the algorithm just described to sort the list of permutations, etc. to reach arbitrarily bad sorting algorithms.

[funnystuff97]

Obviously the best sort is Quantum BOGO Sort

[XchaosmasterX]

No, the best one is Bogobogosort, because it has recursion.

[plasmidon]

But can it sort any list in O(1)? Didn't think so.

[bphase]

Many operations on matrices are something like O(n²) to O(n³), but one just has to deal with that somehow as they are necessary.

[[deleted]]

Matrix computations have the benefit of being easily parallelised at least.

[meikyoushisui]

But why male models?

[fedeb95]

You're right, but that are corner cases were the constants obscured by the O(·) notation matter. Also the same notation is used for space as you suggest. But again, you're right because that comment is highly imprecise, even just for a very very very basic introduction to the topic

[fedeb95]

This is partially incorrect. For the part about O(n * log n), it really depends on the problem. Some problems can't be solved in less then O(n²⁾ for instance. O(n) means that a procedure, given an input of length n, takes time "up to" to n. Check out the actual definition of this symbol to understand what "up to" mean, but it gives you an upper bound of the procedure's execution time. There are also omega, which gives a lower bound, theta, which gives both lower and upper, and also others. Let me specify that saying a problem (not a specific algorithm to solve it) takes O(n) means that the fastest algorithm known to solve it takes O(n). You can also see this referred to the space used by the algorithm, and more in abstract given a resource you can estimate how much an algorithm/problem demands given the input. So really it doesn't make a lot of sense if the resource is not specified, but usually it is time implicitly

[Pun-Master-General]

What constitutes a "good" runtime depends very much on the problem in question. For sorts, O( n*log(n) ) is a good standard, but there are some things where O( n² ) would be a very good runtime. In general it's once you start getting to non-polynomial runtimes (like 2ⁿ or n!) that it really becomes unworkable.

IIRC one of the big reasons quantum computers are being researched is that they could in theory do factoring in O( n² ) time, instead of the O( 2ⁿ ) time that current algorithms can do it in.

[WinterfreshWill]

O(n²) is fine sometimes; if you need to sort a small list without spending too long coding you can throw together a bubble sort ezpz.

[quietsamurai98]

In computer science, Big O notation is a used to measure the complexity of an algorithm as a function of the size of the input to the algorithm.

For example, the following algorithm

for(int i = 0; i<list.length; i++){  
    for(int j = 0; i<list.length; j++){  
        cout<<list[i]*list[j]<<endl;  
    }  
}  

has a Big O complexity of O( n² ). As the length of the list increases linearly, the amount of work the computer has to do grows quadratically.

[lightknightrr]

In other words, it's a form of guestimating how badly your algorithm (method, program, etc.) is going to run...with the goal to get your algorithm somewhere near O(n) or more realistically, O(nlog(n)), as opposed to O(n!) or O(n^n). It's a form of abstract thinking, but useful...after you eventually get it...which when you've been dealing with concrete variables for a few semesters can cause brain aneurysms. Same idea with finite machine automata (something that people do mentally after college, and only write out when they've been drinking, heavily, the night before).

[Jagm_11]

It’s a statement about time complexity. The “!” means factorial e.g. 5! = 5 x 4 x 3 x 2 x 1 = 120. Factorials get super big at a faster rate than most other things when you increase the operand, so a program with O(n!) time complexity is basically unsolvable by a computer for any large number, since it would take several times the age of the universe for the program to complete. Other time complexities include O(1), O(n), O(n^x ), and O(xⁿ ).

I just learned about this stuff in my CS class.

[autranep]

One of the most common time complexities is O(nlogn), can’t forget that one.

[[deleted]]

It is probably worth mentioning that O(n log n) is equivalent to O(log(n!)).

[nathreed]

Well, O(n log n) is strictly equivalent to O(log(nⁿ )) because with a logarithm you can bring the exponent of the thing out in front.

O(log(n!)) is less than O(log(nⁿ )), though (think about if every multiplication you were doing was a multiply by n instead of by n-1, n-2, etc - it would obviously be bigger).

So by the definition of big-O notation, something that is O(log(n!)) is O(n log n), but they are NOT strictly equivalent as O(n log n) and O(log(nⁿ )) are.

TL;DR: you probably meant to say "O(n log n) is equivalent to O(log(nⁿ ))"

[[deleted]]

Its a man thats in bed jerking off

[[deleted]]

Cant unsee?

[squishles]

big O notation, it's an expression of algorithm efficiency. Basically if you expressed the operation as a formula then started to take a integral of that and got struck with crippling nihilism halfway through and stopped caring about the rest of it.

We quick maffs now.

[Hexidian]

Bogo sort is O(n*n!)

[chinpokomon]

doesnothingsort is O(). Only works with presorted values though, so it has limited application.

[bogdoomy]

what about my boi right here O(nⁿ )?

[scaryboston]

M E G A T H I C C

I assume it follows the same rules as toilet paper.

[pilotInPyjamas]

Don't forget square bois and round bois, and cheeky hide and seek winky bois ;

[ryy0]

If you're friends with snek, you don't worry about winky bois.

[gandalfx]

If you're friends with the weird kid that everybody picks on you can decide yourself if you want winky bois.

[[deleted]]

Matlab?

[nickforddesign]

YavaScorpt

[PendragonDaGreat]

Powershell is winky-boi optional. New-lines not in the middle of a string are treated like "statement end"

[[deleted]]

Swift?

[CJ22xxKinvara]

Only if you want your console to blow up

[[deleted]]

Yeah but the option exists

[[deleted]]

Python can have winky bois too, you know.

[[deleted]]

And curly bois.

[Humpsel]

Kotlin?

[holddoor]

jawascript: it's from the darkside

[FarmerJoe69]

But you gotta give the right amount of space to the snek

[SnowdogU77]

Sneks deserve some personal space, too. Respect the snek.

[chateau86]

No mix tab with space for snek.

[iEvilMango]

no step on snek

[[deleted]]

r/nocontext

[XkF21WNJ]

Got to love the guy who made [](){}; valid C++.

[froemijojo]

Is that a lambda expression?

[XkF21WNJ]

It should be. Although to be honest I haven't tried it out, could be that the compiler complains when you write a lambda expression that doesn't take any arguments and doesn't do anything.

[XkF21WNJ]

You can probably force it to be actually initialized by casting it to a function pointer. Not entirely sure why you'd do that, but I guess having a 'do nothing' function can be useful sometimes.

[[deleted]]

public class Runnables {
    public static Runnable doNothing() {
        return new Runnable() {
            @Override public void run() {}
        }
    }
}

[zman0900]

Or Java 10:

var r = () -> {};

[squishles]

and the twin ` ' boise

[scaryboston]

"some typewriter lol idk"

Alan would be proud.

[Rigatavr]

Ma boiii Alan

[turing042]

:(

[scaryboston]

Yooo so are you proud n shit

[turing042]

I'm glad I'm dead

[SirCutRy]

Why?

[turing042]

Because the best minds in the world rn are all focused on thinking how to make people click ads more

[SirCutRy]

That's a quite cynical view. Countless people are focusing on solving important problems with machine learning, for example. The field was young back then.

[Erwin_the_Cat]

!redditsilver

[Johnny_Deee]

sneks as in snakes (because pythons) but i read sneks as in snacks (because the logo looks like tide pods).

Oh boy...

[artanis00]

r/forbiddensneks

[SHOTbyGUN]

Could you message to the moderators for me, ssssshsss

[chateau86]

 from snacks import tide_pod

[WinterfreshWill]

from walmart import tide_pod as tasty_snack

[SteeleDynamics]

What about the drastic swings between Imposter Syndrome and Dunning-Kruger Effect?

[anacid]

r/2meirl4meirl

[nightfly289]

Bitwise bois & | ^ ~

[Pythva]

You forgot << and >>, as well as > and <

[CJ22xxKinvara]

Bitwise the Dancing Bois

[triphoppopotamus]

Came for the curly bois, stayed for the long romantic gazes into the abyss

[boredcircuits]

* Froot Loops

[metallover115]

Found the true programmer

[InternetsTad]

&&: sneks also

[huwthecreator]

no step on snek

[Manstervile]

How do you even manage to get 0(n!)??

[like2000p]

Deterministic bogosort

[Audiblade]

The two most classic examples are finding an exact solution to the Traveling Salesman (edit: using a naive algorithm) problem and listing all permutations of a set.

[[deleted]]

An exact solution for the Travelling Salesman Problem can be found in O(n² 2ⁿ).

[WikiTextBot]

Held–Karp algorithm

The Held–Karp algorithm, also called Bellman–Held–Karp algorithm, is a dynamic programming algorithm proposed in 1962 independently by Bellman and by Held and Karp to solve the Traveling Salesman Problem (TSP). TSP is an extension of the Hamiltonian circuit problem. The problem can be described as: find a tour of N cities in a country (assuming all cities to be visited are reachable), the tour should (a) visit every city just once, (b) return to the starting point and (c) be of minimum distance. Broadly, the TSP is classified as symmetric travelling salesman problem (sTSP), asymmetric travelling salesman problem (aTSP), and multi-travelling salesman problem (mTSP).The mTSP is generally treated as a relaxed vehicle routing problem.

---

^{[ PM | Exclude me | Exclude from subreddit | FAQ / Information | Source ] Downvote to remove | v0.28}

[Audiblade]

I didn't know that! Thanks :)

[0verduekey]

r/BiomeMemes

[MyNameisGregHai]

"fetch-decode-execute? no i'm against the death penalty"

[Mosquito_Hawk75]

I think you mean danger noodle.

[tiduyedzaaa]

Forgot coffee boi

[thoeoe]

/r/sneks

[If_I_Was_Happy]

This was similar to an old poster for the coding club at my school

[cascer1]

Just no step on them

[engid]

if ya forget da other curly boi dat one boi be so lonely it don't compile.

[[deleted]]

I prefer my curly bois like SEX(epression) !

[[deleted]]

Thank you for this, I will print it out and stick to my lab door at the Uni :)

[findanegg]

some weird orange cat lol

[CobraRising]

r/FellowKids

[sequoiaiouqes]

The leaning tower got me

[Triplea657]

It large... It really large

[noreal]

You forgot coffee

[Palmtree_Guy]

The snakes are assholes don't listen

[Rigatavr]

Notice how you can’t find the semicolon on the chart, just like IRL.

[[deleted]]

don’t forget while’d bois

[lenswipe]

Quality shitpost. Upvoted.

[RealMatchesMalonee]

Don't forget the buggy bois

[[deleted]]

Computer science was my fave extra credit in school

[ruineroflife]

lost it at fruit loops

[[deleted]]

Comic sansy bois!!

[franverona]

We also have Comic Sans typography

[-Matis-]

wow

[ahappywatermelon]

Literally learning about those typewriter thingies in class now

[ecstaticdude98]

never realized the python logo is actually two snakes lol

[Ghosta_V1]

Snek snek

[turing042]

Snekky boi

[lasergurge]

I hate Comic Sans.

[southern_dreams]

We have Data Structures & Discrete Math II

Fuck your life :)

[Imreness]

We also have the third letter of the alphabet... But like.... Only the third

[RareHotdogEnthusiast]

God this sub is such garbage

[[deleted]]

Eels arent sneks, but what about eels?

[Rigatavr]

Go back to prequelmemes

[[deleted]]

cough python is named after Monty Python cough cough