jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Comment on isSorted complexity. (#10686) [ci skip]

Browse source
This commit is contained in:
Federico Ceratto 2019-02-16 14:56:26 +00:00 • committed by Miran
commit 51c43218c9
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
lib/pure/algorithm.nim
View file

@ -511,7 +511,7 @@ func isSorted*[T](a: openArray[T],
order = SortOrder.Ascending): bool = order = SortOrder.Ascending): bool =
## Checks to see whether ``a`` is already sorted in ``order`` ## Checks to see whether ``a`` is already sorted in ``order``
## using ``cmp`` for the comparison. Parameters identical ## using ``cmp`` for the comparison. Parameters identical
## to ``sort``. ## to ``sort``. Requires O(n) time.
## ##
## **See also:** ## **See also:**
## * `isSorted proc<#isSorted,openArray[T]>`_ ## * `isSorted proc<#isSorted,openArray[T]>`_