OK, but maybe it would be better to mention that this asymptotic is only due to sorting. The described in the comment algorithm is works blatantly in O(n), so the reader can be confused. Something like this:  ```suggestion      /// The algorithm works in O(n) time, but the overall function works in O(n * log(n)) due to sorting.  ```