HiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 24 hours agoMarge sortlemmy.mlimagemessage-square15fedilinkarrow-up1399arrow-down110cross-posted to: programmerhumor@lemmy.ml
arrow-up1389arrow-down1imageMarge sortlemmy.mlHiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 24 hours agomessage-square15fedilinkcross-posted to: programmerhumor@lemmy.ml
minus-squareskibidi@lemmy.worldlinkfedilinkarrow-up10·17 hours agoNote: N^2 and NlogN scaling refer to runtime when considering values of N approaching infinity. For finite N, it is entirely possible for algorithms with worse scaling behavior to complete faster.
Note: N^2 and NlogN scaling refer to runtime when considering values of N approaching infinity.
For finite N, it is entirely possible for algorithms with worse scaling behavior to complete faster.