sebastiancarlos@lemmy.sdf.org to Programmer Humor@lemmy.mlEnglish · 2 years agoFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.orgimagemessage-square2fedilinkarrow-up14arrow-down11
arrow-up13arrow-down1imageFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.orgsebastiancarlos@lemmy.sdf.org to Programmer Humor@lemmy.mlEnglish · 2 years agomessage-square2fedilink
minus-squarenekomusumeninaritai@lemmy.blahaj.zonelinkfedilinkEnglisharrow-up2·2 years agoSo 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?
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?