sprogrammerhumor·Programmer Humorbysebastiancarlos Faster Sorting Algorithm Discovered by Speaking in TonguesView original on lemmy.sdf.org99Comments8Reply
wwebghost0101 lemmy.fmhy.ml3Hide 3 repliesIs there a real source to this or is there a joke that flew over my head?16Reply
ssebastiancarlos replylemmy.sdf.orgIt's a parody of the hype around AI, particularly the "AI discovers faster sorting algorithm" news from last week. Full (satirical) source.28Reply
Pitri replylemmy.blahaj.zonethe last paragraph makes incredibly hard to take it seriously, tbh.4Reply
BrooklynMan lemmy.mlyes, i can quickly sort these people into the loony bin and move on with my day without wasting a single moment listening to what they have to say. Such a time-saver!12Reply
nnekomusumeninaritai lemmy.blahaj.zoneSo doesn't O(nlog(n)) = O(nlog(n)/10)? I guess you'd want the faster one all things being equal, but is that part of the joke?2Reply
8 replies
Is there a real source to this or is there a joke that flew over my head?
It's a parody of the hype around AI, particularly the "AI discovers faster sorting algorithm" news from last week. Full (satirical) source.
the last paragraph makes incredibly hard to take it seriously, tbh.
The "tongues" sounds like Rick and Morty aliens talking. Lol
yes, i can quickly sort these people into the loony bin and move on with my day without wasting a single moment listening to what they have to say. Such a time-saver!
Praise the machine spirit! Praise the omnissaiah!
/40K
So doesn't O(nlog(n)) = O(nlog(n)/10)? I guess you'd want the faster one all things being equal, but is that part of the joke?