Post #2639735

@ela@infosec.exchange @loke@functional.cafe There's a lot of examples of this. Like mergesort vs quicksort (yes, no one uses vanilla quicksort but I would argue that it's closer to quick than merge). And then in network science you have these algorithms where runtime is around cubic and whether quadratic, cubic or tertiary is the right choice very much depends on the properties of your graph, like actual size, rather than what happens when n goes towards infinite. Edit: urgh, I'm being a reply guy. Sorry. Graphs are neat.