@noxypaws In the case of programming, "Big O" is mostly adopting existing math terms because they fit, but a lot of the complex 'Big O math-theory' stuff doesn't actually help.

It really is as simple as my first toot, there's literally nothing more to it when discussing algo complexity.

http://bigocheatsheet.com/ is the 'building block' list for low-level algo components including storage to pick-and-choose.

Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowell

@noxypaws Or are you more wondering "Why is QuickSoft n² worst-case but MergeSort is n log(n) but they're BOTH n log(n) best-case?" to understand how you figure out the complexity of an algo?