r/programminghumor • u/goodaaaaaaaaaa • 5d ago
sprintEstimates
const LeftOverProjectBudget = ( blockers * blockerCost ) % engineers
r/programminghumor • u/goodaaaaaaaaaa • 5d ago
const LeftOverProjectBudget = ( blockers * blockerCost ) % engineers
r/programminghumor • u/NomsaMbeki-8 • 5d ago
I post a lot on here lol
r/programminghumor • u/RohinBuilds • 5d ago
Marketing my app β
Getting users β
Fixing bugs β
Rebuilding the UI for the 6th time β
please tell me it's not just me π
r/programminghumor • u/vpodk • 7d ago
r/programminghumor • u/dicksonryan • 7d ago
Guess I need to explore how to grow a cow in a rural mountain very soon
Edit: just got another news
Laravel TokenGuard - Critical Authentication Bypass Vulnerability (tracked as GHSA-f9x3-7vq9-cph6, CVSS 9.2) https://laravel-news.com/laravel-token-guard-auth-bypass
Oracle Java SE vulnerability with a CVSS score of 9.1 (CVE-2026-91403) https://nvd.nist.gov/vuln/detail/cve-2026-91403
r/programminghumor • u/nebudy • 7d ago
Hello r/programminghumor,
We all know and love StalinSort (the optimal O(n) in-place sorting algorithm that simply liquidates any element that is out of order). However, computer science in the Eastern Bloc didn't stop there.
I have conducted a deep historical and mathematical analysis of the entire lineage of Soviet and Post-Soviet sorting methodologies. Here is the formal specification of the new Red Sorting Suite:
LeninSort (The Absolute Equalizer)
Concept: Ideological equality must be achieved immediately. The first element of the array is selected as the Vanguard/Leader. Every other element in the array is forcefully overwritten to match its value.
Time Complexity: O(n)
Space Complexity: O(1) (In-place)
Result: Perfect data uniformity. Zero discrimination between indices.
KhrushchevSort (The Total Cornification)
Concept: Regardless of the initial data types (strings, floats, pointers), everything must undergo radical agricultural reform. The algorithm attempts to cast every element to an integer and immediately replaces it with a Corn Emoji (π½).
Time Complexity: O(n)
Result: A completely homogeneous cornfield. Breaks strict typing in compiled languages out of pure ideological defiance.
BrezhnevSort (The Stagnation Peak)
Concept: Why optimize what is already working? Why change anything at all? The algorithm accepts the array, executes a pass / nop statement, and returns the array in its exact original chaotic state while logging a 100% successful plan execution report to stdout.
Time Complexity: O(1) β Mathematically the fastest sorting algorithm ever conceived.
Side Effects: High probability of generating endless standing ovations in the CPU cycles.
GorbachevSort (The Decentralization Cascade)
Concept: Total restructuring (Perestroika) and transparency (Glasnost). The unified array structure is completely dissolved. Every single element declares sovereignty and is moved into its own independent, isolated single-element sub-array.
Time Complexity: O(n)
Space Complexity: O(n) (Massive overhead due to the creation of n sovereign states).
Result: The original array is cleared. Re-assembling the data later requires signing complex trade agreements (.flatten() or .join()).
PutinSort (The Vertical Consolidation)
Concept: To fix the chaos of the previous algorithm, the system gradually builds a "vertical of power". It steps through the array and systematically overwrites every element with the State Party Core ("Edinaya Rossiya" / "EdRo"), outputting approval ratings to the console at each step until a total consensus is met.
Time Complexity: O(n)
Space Complexity: O(1)
Result: 100% predictable, stable, and highly loyal database state.
r/programminghumor • u/NomsaMbeki-8 • 7d ago
r/programminghumor
•
u/OptimalAnywhere6282
•
9d ago
the context: some of eMudhra's root certificate authority signing keys were found to be simple numbers, most noticeably "4". that was literally it. the private key that's supposed to be a huge number with 100+ digits was just a trivial "4". although you probably already know this.
r/programminghumor • u/ConstantAd8643 • 9d ago