alphacyberranger@sh.itjust.works to Programmer Humor@programming.devEnglish · 5 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 · 5 months agomessage-square17fedilink
minus-squareVenator@lemmy.nzlinkfedilinkarrow-up0·5 months agoWhy would you want a specific time complexity? Wouldn’t it be better if it’s faster?
minus-squareJaddedFauceet@lemmy.worldlinkfedilinkarrow-up0·5 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-up0·edit-25 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).
Why would you want a specific time complexity? Wouldn’t it be better if it’s faster?
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).