minus-squareskibidi@lemmy.worldtoProgrammer Humor@programming.dev•Marge sortlinkfedilinkarrow-up10·1 month 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. linkfedilink
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.