HiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 25 days agoMarge sortlemmy.mlimagemessage-square19linkfedilinkarrow-up1466arrow-down110cross-posted to: [email protected]
arrow-up1456arrow-down1imageMarge sortlemmy.mlHiddenLayer555@lemmy.ml to Programmer Humor@programming.devEnglish · 25 days agomessage-square19linkfedilinkcross-posted to: [email protected]
minus-squareskibidi@lemmy.worldlinkfedilinkarrow-up10·25 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.