alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 2 months agoO of what nowsh.itjust.worksimagemessage-square7fedilinkarrow-up15arrow-down10
arrow-up15arrow-down1imageO of what nowsh.itjust.worksalphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 2 months agomessage-square7fedilink
minus-squareJaddedFauceet@lemmy.worldlinkfedilinkarrow-up0·2 months agoLikely they want a lower time complexity. for example a question can be trivially solved in O(n^2). but there is no know < O(n) solution, so they ask for O(n)
minus-squareTiefling IRL@lemmy.blahaj.zonelinkfedilinkarrow-up1·edit-21 month 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).
Likely they want a lower time complexity.
for example a question can be trivially solved in O(n^2). but there is no know < O(n) solution, so they ask for 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).