alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 4 months agoO of what nowsh.itjust.worksimagemessage-square19fedilinkarrow-up1238arrow-down19
arrow-up1229arrow-down1imageO of what nowsh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 4 months agomessage-square19fedilink
minus-squareTiefling IRL@lemmy.blahaj.zonelinkfedilinkarrow-up2·edit-24 months 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).