Szathmáry László honlapja @ DEIK | DLang / Sort in descending order

Simple solution

(1) descending order
def main(): li = [8, 5, 1, 3] print(sorted(li)) # [1, 3, 5, 8] print(sorted(li, reverse=True)) # [8, 5, 3, 1]	import std.stdio; import std.algorithm; void main() { int[] li = [8, 5, 1, 3]; writeln(li.sort); // [1, 3, 5, 8] writeln(li.sort.reverse); // [8, 5, 3, 1] }

Using a custom comparator, we can do it in one step:

(2) advanced sorting
def main(): li = [8, 5, 1, 3] print(sorted(li, reverse=True)) # [8, 5, 3, 1]	import std.stdio; import std.algorithm; void main() { int[] li = [8, 5, 1, 3]; writeln(li.sort!((a, b) => a > b)); // [8, 5, 3, 1] }