alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 3 months agoO of what nowsh.itjust.worksimagemessage-square17fedilinkarrow-up11arrow-down10
arrow-up11arrow-down1imageO of what nowsh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 3 months agomessage-square17fedilink
minus-squareTiefling IRL@lemmy.blahaj.zonelinkfedilinkarrow-up0·edit-23 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).