Display program code

mergesort.pl : Mergesort
Mergesorts individual numbers into a sorted chain. Time-complexity is O(n*log(n)) (n numbers to sort).

How to use:
For numbers X1, .., Xn, you enter sort(X1), .., sort(Xn),
and get them sorted with duplicates removed (S1 < S2 < .. < Sm) as S1 <<< S2, .., S(m-1) <<< Sm.

Program: Change the code, then submit!

Console: Enter query or select example from below, then submit and wait for answer!

Select example query: 

CHR
WebCHR help - CHR Website - (c) Copyrights Martin Kaeser Uni Ulm 2007