sub Merge(@) {
  my @array = @_;
  MergeSort (0, $#array);
  return @array;

  sub MergeSort($$) {
    my $first = shift;
    my $last = shift;
    if ($last>$first) {
      my $mid = int(($last+$first)/2);
      MergeSort($first, $mid);
      MergeSort($mid+1, $last);
      my @b;
      
      @b = ( @array[$first..$mid], @array[reverse($mid+1..$last)] );
      my ($i, $j, $k) = (0, $last-$first, $first);
      for (; $k<=$last; $k++) {
        $array[$k] = ($b[$i]<$b[$j]) ? $b[$i++] : $b[$j--];
      }
    }
  }
}