Custom sort, is this a bug?

[alpine]

*snip*
I think there is an error in your loop when the list has an even count of items.
*snip*

You're right, the loop must be less by one:

Code: Pascal  [Select][+][-]

1.   J := List.Count;
2.   for I := 0 to Pred(J div 2) do
3.     List.Exchange(I, Pred(J) - I);

But my question was whether Thaddy wants to just reverse the list by playing tricks with CustomSort.

[Thaddy]

Well, reversing a list is a common pattern.