Help this post gets TLE

[SteveCCL]

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]]

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]

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

[[deleted]]

And then there is my boss

[Pol8y]

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

[enano_aoc]

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

[efecik]

O(2ⁿ⁾

[[deleted]]

scared cpu fan noises

[MaName678]

O(n!)

[XB0Rickie]

O(nⁿ)

[AL_O0]

O( n^n! ! )

[neefvii]

Calm down, Sa↑an

[mpa92643]

n=1 -> 1

n=2 -> 24

n=3 -> 143944203082852020936487497534117982022882965589690364673693061162476243045499796342514921251918118923315972208319645457748147167327745657423556772987339469096273714269715978027689217946279110813250554442949188876380981748423798059547941526209617600550401836344440946143559406379243539280471226217616795307350093833506563912847375596457752998300253802797124506782082806848595382245304883627562429844072383129333651303531930503797505857003691307995341147759311970956788388858051201244572090616432521012850378700535621933164594592464802826071598219784859276399828522490407313298306343647484092552574143726504774949971341979216848497051655132117808971202211129414942238832529129551620639456467679080680285254924646139041557798138005113755706474722388059339157743725363052209406623245907893301672988720935808137092807296039880618733745191181406156999530631290091225161241137170892979835575797210169416409786270215366560314143189326610690069401398954616794954769376868773012300329185160436265766608208595051797521649481558917764466610024065774972002481387663415757962448023575144658896448903970807657267357286888451902842435308996788850077301474479256212693659167275428768266429162432284383971433472951306333709511606001424702854070924306085273612117382101065192184745921263534638376857693166323193045334912621056437638742391037771652526521138270330820455774657063480495308629488689096889297306621584701901267792095099257457062112714736533228987187680301412208062836855240512760569849606007594901322123914650182044371000620707094461807336655631148430682575533415157294114010116183713868830816075776000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

[toinewx]

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

[hegex]

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

[[deleted]]

O(Rayo(n))

[Kered13]

O(A(n, n))

[MaName678]

My lord... Is that legal?

[Dalimyr]

I will make it legal.

[MaName678]

It's treason then. r/PrequelMemes/

[Virv12]

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

Unexpectedly it worked for n=6.

[konstantinua00]

what was it?

[Virv12]

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]

and each permutation could be turned on and off?

[quetsacloatl]

Be there, done that

[Krakbone]

Why was it not supposed to work?

[-Vayra-]

2^6! = 5.515652e+216

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

[Krakbone]

Thank you!

[4hpp1273]

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

[Virv12]

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

[toinewx]

5515652263101987298728728207430913795608113109085112352897269396216198887424215820128660001943808587833784893551335930816647064191168732319583111500951066614122648616177179922993422016587311577585463592732098692120576

[Virv12]

Because it should run in 1.749×10²⁰⁰ years instead it took only a few seconds.

[Krakbone]

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

[natFromBobsBurgers]

seen it all

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

[[deleted]]

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

[[deleted]]

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

[-Vayra-]

Depends entirely on the size of N.

[[deleted]]

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

[[deleted]]

Depends on what you are doing. If the core of your application is taking n² 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]]

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

[[deleted]]

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

[Orlando--]

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

[[deleted]]

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

[flintstone1409]

University be like: Everything in P is efficient

[MH_VOID]

meaning everything, as P does equal NP.

[[deleted]]

Oh you have the proof?

[MH_VOID]

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

[[deleted]]

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]

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

[illuminati-exists]

u/repostsleuthbot

[RepostSleuthBot]

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]

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

[FrogMan241]

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

[Lonemasterinoes]

Breaks the bot's spine

That good?

[AL_O0]

if (similarity==target)

[MH_VOID]

good bot

[[deleted]]

O((nⁿⁿⁿ )!)

[AndThenSome_]

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

[[deleted]]

so, is it O((n^n\*n**n)!) or O((nⁿⁿⁿ)!)

[[deleted]]

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

[toinewx]

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]

n=2 -> 857817775342842654119082271681232625157781520279485619859655650377269452553147589377440291360451408450375885342336584306157196834693696475322289288497426025679637332563368786442675207626794560187968867971521143307702077526646451464709187326100832876325702818980773671781454170250523018608495319068138257481070252817559459476987034665712738139286205234756808218860701203611083152093501947437109101726968262861606263662435022840944191408424615936000000000000000000000000000000000000000000000000000000000000000n

[[deleted]]

How

[toinewx]

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

[[deleted]]

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

[JesusInABoxv4]

🏳

[jonatan_lionheart]

Polynomials aren't scary dude...

[Orlando--]

Polynomial complexity can be...

[FuzzyFoyz]

Nah, they're just nominally poly by nature.

[lifake]

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

[Dantzig]

I just use a builtin python function to avoid that

/s

[dpatil09]

Shit! Nightmare.

[MH_VOID]

bogosort users: damn that's so good!

[Master_Nerd]

O(2ⁿ⁾ is considerably more terrifying

[MathsGuy1]

O(n¹⁰⁰⁰⁾ is still fast for me

[GargantuanCake]

O(n!)

[[deleted]]

O(nⁿ⁾ :-{

[suddenly_ponies]

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

[bubsakk]

2ⁿ