>>Some functions might have exponential >>performance differences when changing parameters, some might have >>linear. > > That might actually be useful to put in the documentation, for example > with the big-O notation.
You mean we should document the complexity with big-O notation for every function, or just some general heads up that different functions have different complexities, also dependant on value of parameters? Goba
