@sebastiancarlos@lemmy.sdf.org to Programmer Humor@lemmy.mlEnglish • 2 years agoFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.orgimagemessage-square8fedilinkarrow-up124
arrow-up124imageFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.org@sebastiancarlos@lemmy.sdf.org to Programmer Humor@lemmy.mlEnglish • 2 years agomessage-square8fedilink
minus-square@nekomusumeninaritai@lemmy.blahaj.zonelinkfedilinkEnglish2•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?