diff options
| author | Andreas Rumpf <rumpf_a@web.de> | 2019-02-18 09:56:01 +0100 |
|---|---|---|
| committer | Andreas Rumpf <rumpf_a@web.de> | 2019-02-18 09:56:01 +0100 |
| commit | c8e33cbb75caf21a76d379ce94b42baffbefa73f (patch) | |
| tree | 2382ee25980be7fa3e89a1a5483cb78857463115 /lib/pure/algorithm.nim | |
| parent | 9e754c3b0623433380de171d25bfb862eb2f9ab7 (diff) | |
| parent | 8b39551fca81e95b51393a2a8e702eebe3ba7c51 (diff) | |
| download | Nim-c8e33cbb75caf21a76d379ce94b42baffbefa73f.tar.gz | |
fixed merge conflict
Diffstat (limited to 'lib/pure/algorithm.nim')
| -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]>`_ |