Logo

Programming-Idioms

  • Perl
  • C#
  • Scheme
  • Pascal

Idiom #290 Sort sublist

Sort the part of the list items from index i (included) to index j (excluded), in place, using the comparator c.

Elements before i and after j must remain unchanged.

FsiArraySort
ArraySort(@items[i], @items[j-1], elemsize, @c, @exchangeproc);

ArraySort is agnostic of the type of elements in the array it sorts, so it needs to know the size of an item (elemsize), as well as a reference to a procedure that exchanges items (exchangeproc).
@items[$i..$j] = sort $c @items[$i..$j];

Use perl's list slice capability to extract the elements between $i and $j, sort them using comparator function $c, and then replace the slice in situ.
items.setRange(i, j, items.sublist(i, j)..sort(c));
New implementation...
< > ⌨
programming-idioms.org 
ArraySort(@items[i], @items[j-1], elemsize, @c, @exchangeproc);
@items[$i..$j] = sort $c @items[$i..$j];
items.setRange(i, j, items.sublist(i, j)..sort(c));
sub := items[i:j]
sort.Slice(sub, func(a, b int) bool {
	return c(sub[a], sub[b])
})
slices.SortFunc(items[i:j], c)
items.subList(i, j).sort(Comparable::compareTo);
items[i:j] = sorted(items[i:j], key=functools.cmp_to_key(c))
items[i:j] = sorted(items[i:j], key=c)
items[i..j] = items[i..j].sort_by{|el| c(el) }
items[i..j].sort_by(c);