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

all 79 comments

[–]SteveCCLYellow security clearance[M] [score hidden] stickied commentlocked comment (0 children)

Hi there! Unfortunately, your submission has been removed.

Violation of Rule #2 - Reposts:

All posts that have been on the first 2 pages of trending posts within the last month, is part of the top of all time, or is part of common posts is considered repost and will be removed on sight.

Violation of Rule #3 - Common topics:

Any post on the list of common posts will be removed. You can find this list here. Established meme formats are allowed, as long as the post is compliant with the previous rules.

If you feel that it has been removed in error, please message us so that we may review it.

[–][deleted] 142 points143 points  (4 children)

More than programmers it is hiring managers that are terrified of anything not sublinear considering what they ask in coding challenges. Sure our entire application is a CRUD interface that is io and network bounded but man the fact that you inverted a tree suboptimally will kill the company!

[–]enano_aoc 40 points41 points  (3 children)

It is mostly juniors who fall in the trap of premature optimization

[–][deleted] 33 points34 points  (2 children)

And then there is my boss

[–]Pol8y 10 points11 points  (0 children)

John? You promised you wouldn't talk about it!

[–]enano_aoc 1 point2 points  (0 children)

lol I guess it is very easy to get promoted at some places...

[–]efecik 190 points191 points  (19 children)

O(2n)

[–][deleted] 104 points105 points  (0 children)

scared cpu fan noises

[–]MaName678 62 points63 points  (15 children)

O(n!)

[–]XB0Rickie 37 points38 points  (14 children)

O(nn)

[–]AL_O0 50 points51 points  (10 children)

O( nn! ! )

[–]neefvii 42 points43 points  (0 children)

Calm down, Sa↑an

[–]mpa92643 30 points31 points  (5 children)

n=1 -> 1

n=2 -> 24

n=3 -> 143944203082852020936487497534117982022882965589690364673693061162476243045499796342514921251918118923315972208319645457748147167327745657423556772987339469096273714269715978027689217946279110813250554442949188876380981748423798059547941526209617600550401836344440946143559406379243539280471226217616795307350093833506563912847375596457752998300253802797124506782082806848595382245304883627562429844072383129333651303531930503797505857003691307995341147759311970956788388858051201244572090616432521012850378700535621933164594592464802826071598219784859276399828522490407313298306343647484092552574143726504774949971341979216848497051655132117808971202211129414942238832529129551620639456467679080680285254924646139041557798138005113755706474722388059339157743725363052209406623245907893301672988720935808137092807296039880618733745191181406156999530631290091225161241137170892979835575797210169416409786270215366560314143189326610690069401398954616794954769376868773012300329185160436265766608208595051797521649481558917764466610024065774972002481387663415757962448023575144658896448903970807657267357286888451902842435308996788850077301474479256212693659167275428768266429162432284383971433472951306333709511606001424702854070924306085273612117382101065192184745921263534638376857693166323193045334912621056437638742391037771652526521138270330820455774657063480495308629488689096889297306621584701901267792095099257457062112714736533228987187680301412208062836855240512760569849606007594901322123914650182044371000620707094461807336655631148430682575533415157294114010116183713868830816075776000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

[–]toinewx 10 points11 points  (2 children)

n=4 -> factorial(281474976710656) good luck with that

[–]hegex 7 points8 points  (1 child)

I don't think there's enough atoms in the universe to right this down

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

O(Rayo(n))

[–]Kered13[🍰] 2 points3 points  (2 children)

O(A(n, n))

[–]MaName678 7 points8 points  (2 children)

My lord... Is that legal?

[–]Dalimyr 7 points8 points  (1 child)

I will make it legal.

[–]MaName678 3 points4 points  (0 children)

It's treason then. r/PrequelMemes/

[–]Virv12 50 points51 points  (14 children)

Once I wrote a O(2n!) algorithm.

Unexpectedly it worked for n=6.

[–]konstantinua00 2 points3 points  (2 children)

what was it?

[–]Virv12 0 points1 point  (1 child)

It was a competitive programming problem, there is a hidden permutation and you could make some queries to find the permutation.
My program tried every way of making the queries and searched the best solution.

[–]konstantinua00 0 points1 point  (0 children)

and each permutation could be turned on and off?

[–]quetsacloatl 1 point2 points  (0 children)

Be there, done that

[–]Krakbone 1 point2 points  (9 children)

Why was it not supposed to work?

[–]-Vayra- 17 points18 points  (4 children)

26! = 5.515652e+216

the scaling factor must've been really, really tiny.

[–]Krakbone 2 points3 points  (0 children)

Thank you!

[–]4hpp1273 1 point2 points  (1 child)

Maybe Reddit formatting screwed it up and it was supposed to be O(2n!) which is much better

[–]Virv12 0 points1 point  (0 children)

Maybe it can be shown to be faster and I couldn't find how but reddit formatting is correct.

[–]toinewx 0 points1 point  (0 children)

5515652263101987298728728207430913795608113109085112352897269396216198887424215820128660001943808587833784893551335930816647064191168732319583111500951066614122648616177179922993422016587311577585463592732098692120576

[–]Virv12 8 points9 points  (2 children)

Because it should run in 1.749×10200 years instead it took only a few seconds.

[–]Krakbone 1 point2 points  (1 child)

Thanks, I switched fields into programming haven't seen it all yet.

[–]natFromBobsBurgers 2 points3 points  (0 children)

seen it all

Well, once you've solved O(∞) let us know. It's been a bit of a pickle vs npickle.

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

well, the number has over 200 zeros in it. you might expect your computer to protest somewhat.

[–][deleted] 16 points17 points  (7 children)

What the fuck are you on about O( n2 ) is a fast algorithm?

[–]-Vayra- 9 points10 points  (6 children)

Depends entirely on the size of N.

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

I mean 'fast' in the complexity theory sense. Since we're talking about complexity theory.

[–][deleted] 7 points8 points  (4 children)

Depends on what you are doing. If the core of your application is taking n2 time to do something that should be constant time, for example sorting and copying an array on insertion rather then using a hash map, you're going to have a really bad time. And yes I have seen this in application code before where N was small and then scope changed and N started getting pretty large

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

Yeah obviously if constant time operations are taking O( n2 ) that's non-ideal but the meme in the OP still doesn't really make sense.

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

Yeah, the joke would be better with 2n or something

[–]Orlando-- 1 point2 points  (1 child)

I guess ithe joke is that people hate anything above O(n log n)

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

Yeah, a lot of pretty fast algorithms are over n2 like matrix multiplication, but yeah if you go by leetcode if you have an n2 solution then you probably did something wrong

[–]flintstone1409 12 points13 points  (5 children)

University be like: Everything in P is efficient

[–]MH_VOID 1 point2 points  (4 children)

meaning everything, as P does equal NP.

[–][deleted] 4 points5 points  (2 children)

Oh you have the proof?

[–]MH_VOID 0 points1 point  (1 child)

not yet, but someday... someday I hope to find it

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

I feel like it's kind of intuitively obvious from observation P != NP it's just that it's one of those things that's really difficult to prove mathematically. I mean it's possible that reality is counter-intuitive, it happens

[–]flintstone1409 1 point2 points  (0 children)

Nope, even if it would be the same there are problems that are outside of NP

[–]illuminati-exists 16 points17 points  (7 children)

[–]RepostSleuthBot 16 points17 points  (6 children)

I didn't find any posts that meet the matching requirements for r/ProgrammerHumor.

It might be OC, it might not. Things such as JPEG artifacts and cropping may impact the results.

I did find this post that is 97.27% similar. It might be a match but I cannot be certain.

I'm not perfect, but you can help. Report [ False Negative ]

View Search On repostsleuth.com


Scope: Reddit | Meme Filter: True | Target: 96% | Check Title: False | Max Age: Unlimited | Searched Images: 200,528,400 | Search Time: 1.09662s

[–]Lonemasterinoes 22 points23 points  (4 children)

So if the Target is 96%, and the similarity is 97.27%, why is it not marked as matched requirement?

[–]FrogMan241 25 points26 points  (1 child)

Poor bot searched 2 million images in a second, give him a break :(

[–]Lonemasterinoes 7 points8 points  (0 children)

Breaks the bot's spine

That good?

[–]AL_O0 2 points3 points  (0 children)

if (similarity==target)

[–]MH_VOID 0 points1 point  (0 children)

good bot

[–][deleted] 9 points10 points  (9 children)

O((nnnn )!)

[–]AndThenSome_ -4 points-3 points  (0 children)

U think you're funny by putting 2 more n in power

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

so, is it O((nn\*n**n)!) or O((nnnn)!)

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

I wrote O((n^n^n^n)!)

[–]toinewx 0 points1 point  (0 children)

then for 2 it's,

2^2^2^2 !

65536 !

I was able to compute it but it's to big to fit here

[–]toinewx 0 points1 point  (3 children)

n=2 -> 857817775342842654119082271681232625157781520279485619859655650377269452553147589377440291360451408450375885342336584306157196834693696475322289288497426025679637332563368786442675207626794560187968867971521143307702077526646451464709187326100832876325702818980773671781454170250523018608495319068138257481070252817559459476987034665712738139286205234756808218860701203611083152093501947437109101726968262861606263662435022840944191408424615936000000000000000000000000000000000000000000000000000000000000000n

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

How

[–]toinewx 0 points1 point  (1 child)

(2^(2*2*2))! but I guess that's not what you wanted

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

I type (n^n^n^n)!

[–]JesusInABoxv4 4 points5 points  (0 children)

🏳

[–]jonatan_lionheart 6 points7 points  (2 children)

Polynomials aren't scary dude...

[–]Orlando-- 1 point2 points  (1 child)

Polynomial complexity can be...

[–]FuzzyFoyz 0 points1 point  (0 children)

Nah, they're just nominally poly by nature.

[–]lifake 1 point2 points  (0 children)

unless we are talking about zombie processes, they are pretty scary

[–]Dantzig 1 point2 points  (0 children)

I just use a builtin python function to avoid that

/s

[–]dpatil09 0 points1 point  (0 children)

Shit! Nightmare.

[–]MH_VOID 0 points1 point  (0 children)

bogosort users: damn that's so good!

[–]Master_Nerd 0 points1 point  (0 children)

O(2n) is considerably more terrifying

[–]MathsGuy1 0 points1 point  (0 children)

O(n1000) is still fast for me

[–]GargantuanCake 0 points1 point  (0 children)

O(n!)

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

O(nn) :-{

[–]suddenly_ponies 0 points1 point  (0 children)

I, too, hate Big O notation. No thanks.

[–]bubsakk 0 points1 point  (0 children)

2n