diff options
| author | Federico Ceratto <federico.ceratto@gmail.com> | 2019-02-16 14:56:26 +0000 |
|---|---|---|
| committer | Miran <narimiran@disroot.org> | 2019-02-16 15:56:26 +0100 |
| commit | 51c43218c954a884da8056e0a35cfb6bcfcd214b (patch) | |
| tree | 87ceb48c6f98d8d835b972c13387ec634510de84 | |
| parent | 2610b16f6ede15888de9769b7226233dc8e86b68 (diff) | |
| download | Nim-51c43218c954a884da8056e0a35cfb6bcfcd214b.tar.gz | |
Comment on isSorted complexity. (#10686) [ci skip]
| -rw-r--r-- | lib/pure/algorithm.nim | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/pure/algorithm.nim b/lib/pure/algorithm.nim index 8c8838ed2..b346c7a44 100644 --- a/lib/pure/algorithm.nim +++ b/lib/pure/algorithm.nim @@ -511,7 +511,7 @@ func isSorted*[T](a: openArray[T], order = SortOrder.Ascending): bool = ## Checks to see whether ``a`` is already sorted in ``order`` ## using ``cmp`` for the comparison. Parameters identical - ## to ``sort``. + ## to ``sort``. Requires O(n) time. ## ## **See also:** ## * `isSorted proc<#isSorted,openArray[T]>`_ |