Merge two sorted arrays

#include<iostream>
#include<conio.h>
using namespace std;
void mergeArrays(int a[], int b[], int s1, int s2, int c[]){
	int i=0,j=0,k=0;
	while(i<s1 && j<s2){
		if(a[i] < b[j]){
			c[k++]=a[i++];
		}
		else{
			c[k++]=b[j++];
		}
	}
	
	while(i<s1){
		c[k++]=a[i++];
	}
	while(j<s2){
		c[k++]=b[j++];
	}
}

void divide()

int main(){
	
	int x[3]={2,4,9};
	int y[5]={5,19, 21, 56, 89};
	int s1=3;
	int s2=5;
	int z[s1+s2];
	
	mergeArrays(x, y, s1, s2, z);
	
	for(int i=0; i<s1+s2; i++){
		cout<< z[i]<< "\t";
	}
	
	getch();
	return 0;
}