C Moment

Content Bae: Come over Dijkstra: But there are so many routes to take and I don't know which one's the fastest Bae: My parents aren't home Dijkstra: Dijkstra's algorithm Graph search algorithm Not to be confused with Dykstra's projection algorithm. Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edger W. Dikstra in 1956 and published three years later. 112) The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes, R but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. Dijkstra's algorithm 14 14 Out 10 15 QuIt

Content Replace a semicolon (; with a greek question mark (;) in your friend's JavaScript and watch them pull their hair out over the syntax error. error: unknown start of token: u37e - main.rs:2:30 2 I printin! ("Hello, world!"); help: Unicode character ';' (Greek Question Mark) Looks like ';' (Semicolon), but it is not printin! ("Hello, world!"); Pathetic.

Oh, the classic "JAVA as an acronym" meme with our dancing hot dog friend! This is what happens when you've been compiling the same legacy codebase since Java 1.4. The desperate cry of "Just help me please I've been stuck in this enterprise dev job for the past 5 years and I'm slowly deteriorating" hits harder than a NullPointerException on production. The Pokémon screaming "AAAAAAA" at the bottom is basically every Java developer when they see yet another AbstractSingletonProxyFactoryBean in their codebase. Enterprise Java: where your soul and your variable names both get unnecessarily long!

Content SENIOR DIRECTOR VP OF ENGINEERING BY ADOPTING A MICROSERVICE ARCHITECTURE WE MADE EACH TEAM RESPONSIBLE AND ACCOUNTABLE FOR THEIR OWN SERVICE 3 OF ATLAPI CATIS FATTED IMPOSSIBIE TO REVERT 500 MSLATENGY FOR EACH API CAT 430 INCREASE IN SERVER COST EACH TEAM NOW NEEDS ONCALLS IQUITE

Content cL Project Euler C: Users baron CLionProiects Project Euler - ... nth prime.c - CLion Hie Edt View Navigate ode Retacti Project Euler nth prime.c CMakeLists.txt X main.c X nth prime.c Xe largest prime.h X nth prime.h X cmake-build-debug finclude "nth, Afinclude math.ha double N me.r Scratches and Consc ninntn (InInn-1) pninnnlnlnn log (N) "N) (log (log (N - 1))); Build X , Catarret Dresent Dale. Scanning dependencies of target Project Euler r 5081 Linking C executable Project Euler (MakerilesProject Foler dirnth prime .c.osin En. Moceaned in did tidin 3. 502 me (11 minutes a00) O Tupe here to search Forminal A Euont loa chO CDICA UTEO A Eg 14:39

Content Ben Halpern bendhalpern Sometimes when I'm writing Javascript I want to throw up my hands and say "this is bullshit!" but I can never remember what "this" refers to