@sebastiancarlos to Programmer Humor@lemmy.mlEnglish • 1 year agoFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.orgimagemessage-square8arrow-up131arrow-down11
arrow-up130arrow-down1imageFaster Sorting Algorithm Discovered by Speaking in Tongueslemmy.sdf.org@sebastiancarlos to Programmer Humor@lemmy.mlEnglish • 1 year agomessage-square8
minus-square@nekomusumeninaritai@lemmy.blahaj.zonelinkfedilinkEnglish2•1 year 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?