HiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 5 days agoMarge sortlemmy.mlimagemessage-square17fedilinkarrow-up1453arrow-down110cross-posted to: programmerhumor@lemmy.ml
arrow-up1443arrow-down1imageMarge sortlemmy.mlHiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 5 days agomessage-square17fedilinkcross-posted to: programmerhumor@lemmy.ml
minus-squareskibidi@lemmy.worldlinkfedilinkarrow-up10·4 days 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.