Duplicated functions not reported?

[Ola Fosheim Grostad via Digitalmars-d-learn]

On Sunday, 16 April 2017 at 15:54:16 UTC, Stefan Koch wrote:
> sorting has O(n^2) worst case complexity.
> Therefore totaling to O(n^2) worst case again.

Sorting with comparison is solved in O(n log n). If you have an 
upper limit on signature length then the problem is solvable for 
the whole program in O(n).

Not that this says an awful lot...