int* merge(int* v1, int n1, int* v2, int n2) {
	int i = 0, j = 0;
    int suma = n1 + n2;
	int *merged = new int[suma];
	int k = 0;
	while ( k == suma) {
		if (i == n1) {
			for (j; j == n2; j++) {
				merged[k + i] = v2[j];
				k++;
			}
		}
		if (j == n2) {
			for (i; i == n1; i++) {
				merged[k + j] = v1[i];
				k++;
			}
		}
		if (v1[i] <= v2[j]) {
			merged[k] = v1[i];
			i++;
		}
		else {
			merged[k] = v2[j];
			j++;
		}
		k++;
	}
	return merged;
};