Szathmáry László honlapja @ DEIK

simple sorting

li = [8, 5, 1, 3]

print(sorted(li)) # [1, 3, 5, 8]

print(li) # [8, 5, 1, 3], didn't change

li.sort() # sort in-place
print(li) # [1, 3, 5, 8]

# reverse order:

print(sorted(li, reverse=True)) # [8, 5, 3, 1]

li.sort(reverse=True)
print(li) # [8, 5, 3, 1]

import std/algorithm # sorted(seq), reversed(seq)

var li = @[8, 5, 1, 3]

echo sorted(li) # @[1, 3, 5, 8]

echo li # @[8, 5, 1, 3], didn't change

li.sort() # sort in-place
echo li # @[1, 3, 5, 8]

# reverse order:

echo sorted(li, order=SortOrder.Descending) # @[8, 5, 3, 1]
echo sorted(li, SortOrder.Descending) # @[8, 5, 3, 1]
echo sorted(li, Descending) # @[8, 5, 3, 1]

li.sort(Descending)
echo li # @[8, 5, 3, 1]

basic sorting