mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-30 23:20:29 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fix unstable sort documentation.

Browse source 
Noticed this here: https://dlang.org/library/std/algorithm/sorting/sort.html
This commit is contained in:
WalterWaldron 2016-12-30 03:04:50 -05:00 • committed by GitHub
parent d85b5e0a12
commit 40606feece
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
std/algorithm/sorting.d
View file

@ -1676,7 +1676,7 @@ Params:
Returns: The initial range wrapped as a $(D SortedRange) with the predicate Returns: The initial range wrapped as a $(D SortedRange) with the predicate
$(D binaryFun!less). $(D binaryFun!less).
Algorithms: $(HTTP en.wikipedia.org/wiki/Introsort) is used for unstable sorting and Algorithms: $(HTTP en.wikipedia.org/wiki/Introsort, Introsort) is used for unstable sorting and
$(HTTP en.wikipedia.org/wiki/Timsort, Timsort) is used for stable sorting. $(HTTP en.wikipedia.org/wiki/Timsort, Timsort) is used for stable sorting.
Each algorithm has benefits beyond stability. Introsort is generally faster but Each algorithm has benefits beyond stability. Introsort is generally faster but
Timsort may achieve greater speeds on data with low entropy or if predicate calls Timsort may achieve greater speeds on data with low entropy or if predicate calls