

The conspiratorial thinking isn’t helping your argument.
It’s quite clear you haven’t engaged with this topic outside of internet arguments. I sincerely hope you do some reading and learn more here - you clearly have the passion.
Until then, find someone else to harass.
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.