Huh? It’s already beyond. :-) Big-O notation is about the behavior of functions as their argument goes to some limit. Sometimes the function of interest is the running time or space requirement of an algorithm, sometimes it’s something else, like the asymptotic of a sum.
Make sure to include something about Big-O notation; I’m always surprised at how little it’s generalized beyond algorithms.
Huh? It’s already beyond. :-) Big-O notation is about the behavior of functions as their argument goes to some limit. Sometimes the function of interest is the running time or space requirement of an algorithm, sometimes it’s something else, like the asymptotic of a sum.
In what way can Big-O notation be generalized beyond algorithms? Perhaps it would be useful to define ‘Big-O notation’ and ‘algorithm’.