MERGE SORT
void merge(int v[], int i1, int i2, int fine, int vout[]){
while ( i <= i2-1 && j <= fine ) {
if (v[i] < v[j]) vout[k] = v[i++];
while (i<=i2-1) { vout[k] = v[i++]; k++; }
while (j<=fine) { vout[k] = v[j++]; k++; }
for (i=i1; i<=fine; i++) v[i] = vout[i];