We need better documentation for functions with ranges and templates

[Ola Fosheim Grøstad via Digitalmars-d]

On Wednesday, 16 December 2015 at 23:02:53 UTC, H. S. Teoh wrote:
> Any programmer that has any pretense of caring about the 
> performance of their code ought to know what O(n) means. It's 
> not that hard to understand. There are plenty of online 
> resources to learn about this, even if you didn't have the 
> privilege of having received formal computer science education.

Yes, just use the term "Worst case time complexity is O(n)".

A simple search on google for "time complexity" gives me a nice 
textual and graphical explanation.