pls check my soln....gttng WA again and again.....pls help
#include <stdio.h>
#include <math.h>
void mergeSort(int arr[],int low,int mid,int high){
int i,m,k,l,temp[1001];
l=low;
i=low;
m=mid+1;
while((l<=mid)&&(m<=high)){
if(arr[l]<=arr[m]){
temp[i]=arr[l];
l++;
}
else{
temp[i]=arr[m];
m++;
}
i++;
}
if(l>mid){
for(k=m;k<=high;k++){
temp[i]=arr[k];
i++;
}
}
else{
for(k=l;k<=mid;k++){
temp[i]=arr[k];
i++;
}
}
for(k=low;k<=high;k++){
arr[k]=temp[k];
}
}
void partition(int arr[],int low,int high){
int mid;
if(low<high){
mid=(low+high)/2;
partition(arr,low,mid);
partition(arr,mid+1,high);
mergeSort(arr,low,mid,high);
}
}
int main ()
{
int t;
scanf ("%d", &t);
while (t--) {
int n1, n2, i, j, diff;
scanf ("%d", &n1);
int a1[n1];
for (i = 0; i < n1; i++) {
scanf ("%d", &a1[i]);
}
scanf ("%d", &n2);
int a2[n2], min = 99999;
for (i = 0; i < n2; i++) {
scanf ("%d", &a2[i]);
}
partition (a2, 0, n2 - 1);
for (i = 0; i < n1; i++) {
for (j = 0; j < n2; j++) {
diff = abs (a2[j] - a1[i]);
if (diff < min) {
min = diff;
} else if (diff > min) {
break;
}
}
if (min == 0) {
break;
}
}
printf ("%d\n", min);
}
return 0;
}
