alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 1 year agoO of what nowsh.itjust.worksimagemessage-square18linkfedilinkarrow-up1183arrow-down19
arrow-up1174arrow-down1imageO of what nowsh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 1 year agomessage-square18linkfedilink
minus-squareTiefling IRL@lemmy.blahaj.zonelinkfedilinkarrow-up2·1 year agoMost of the time O(n^2) is optimized to O(n log n). You’ll get some sort of award if you can figure out a sorting function that runs in O(n).
Most of the time O(n^2) is optimized to O(n log n). You’ll get some sort of award if you can figure out a sorting function that runs in O(n).