Imagine The World With More Windows Computers

Steve jobs Linus torvalds open source Tech history Kernel development

Linux Programming Backend MacOS Apple

1 month ago 327,386 views 0 shares

Imagine The World With More Windows Computers

linux-memes, steve-jobs-memes, linus-torvalds-memes, apple-memes, open-source-memes | ProgrammerHumor.io

Steve Jobs really tried to pull a "join us and kill your baby" move on Linus Torvalds back in 2000. Imagine the audacity: "Hey, come work for Apple, but first, stop doing that thing you're literally famous for creating." Torvalds looked at that offer, probably laughed in Finnish, and said "nah, I'm good." Thank the tech gods he did, because without Linux we'd be living in a dystopian hellscape where servers run Windows and Docker containers are just a fever dream. The man literally chose open-source ideals over a cushy Apple paycheck and continues maintaining the kernel that powers like 90% of the internet, Android phones, and basically every server worth its salt. Meanwhile, Steve's probably doing that prayer hands thing from beyond the grave, still wondering why anyone would turn down Apple.

More Like This

Generating primes under 1,000,000,000

Linux Backend

3 years ago 49.1K views 0 shares

Generating primes under 1,000,000,000 | code-memes, google-memes, array-memes, c++-memes, lines of code-memes, git-memes, github-memes, IT-memes, mac-memes, retweet-memes | ProgrammerHumor.io

Content Anonymous 070817(Sat)00:40:25 No.61270136 61270145 61270572 61272001 61278991 61281662 61283516 Anonymous 070817(Sat)01:42:38 No. 61270572 v 61271841 61275715 61283906 Anonymous 070817(Sat)04:26:25 No. 61271841 61270572 not from a jedi 261270136 Is it possible to generate it with parameterized macros? 1475711763596png (127 KB, 1176620) google yandex iqdb wait Crista Lopes cristalopes 2 Follow The largest C file we found in GitHub has 528Mb, 57 lines of code. Contains the first 50,847,534 primes, all hard coded in an array. RETWEETS 1,491 LIKES 1,882 4:53 PM - 15 Sep 2016 ASL 1 FK

github stars, gotta catch 'em all

Linux Programming Frontend Backend

4 years ago 111.5K views 0 shares

github stars, gotta catch 'em all | code-memes, catch-memes, git-memes, github-memes, data-memes, database-memes, object-memes, templates-memes, IT-memes, front-end-memes, framework-memes | ProgrammerHumor.io

Content OK looks like a simple script will do - we can do this in vanilla IS, no problem! No need for a framework... And the code will be cleaner if I add an abstraction layer over the database and if I use API endpoints 1 guess I could document it and out it on Github, maybe it'll help someone out... Hmm, I guess I should make this a bit more object oriented... ..and it can't hurt to separate out the front-end with templates... WHAT'S THIS?? ANOTHER Javascript Framework!? And alreody 1000 stars on Github?? Tell me you didn' I mean... it wasn't on purpose. CommitStrip.com

fucking reboot

Linux

2 years ago 54.8K views 0 shares

fucking reboot | sudo-memes | ProgrammerHumor.io

Content GEOM LOV Gaunt dao. meaza size CULO ghostface ghostface. ghostface ghostface reboot reboot: Operation not permitted ghostface alias fuckingsudo ghostface fucking reboot Password:

Ayyyyy Dijkstra

Linux Javascript Debugging Testing Backend

3 years ago 128.8K views 0 shares

Ayyyyy Dijkstra | computer-memes, test-memes, node-memes, algorithm-memes, fix-memes, search-memes, network-memes, IT-memes, networks-memes, graph-memes | ProgrammerHumor.io

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. Difkstra in 1956 and published three years later. 121 The algorithm exists in many variants; Dijkstra's original variant found the shortest path between two nodes 2 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 10 OUt

I'Ll Take Even The Devil If He Gives Me Some Luck

Linux

3 months ago 107.9K views 2 shares

I'Ll Take Even The Devil If He Gives Me Some Luck

Content POV: ME SUMMONING WHATEVER I CAN TO GIVE ME LUCK WHEN I UPDATE THE BIOS iglip.com

The K-pocalypse Of App Searching

Linux

8 months ago 209.8K views 0 shares

The K-pocalypse Of App Searching

Trying to find a specific app in KDE is like playing "Where's Waldo?" except everyone is wearing the same striped shirt and glasses. KDE's obsession with the letter K means your app launcher becomes a phonebook where half the entries start with K. KKonsole, KKalc, KKrita, KKwrite... suddenly you're just a man staring blankly into the void, questioning your life choices and wondering if you should've just stuck with GNOME.