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.