找出一个数组中不存在于另一个数组中的元素

#include "stdio.h"

int arr1[10] = {2,2,5,5,1,8,77,55,44,32};
int arr2[10] = {2,44,54,77,32,133,65,8,88,12};

void sort(int * arr,int len)
{
int i = 0,j = 0,k = 0;
int tmp = 0;
for(i = 1; i<len; i++)
{
for(j = 0; j<i; j++)
{
if(arr[i] < arr[j])
{
tmp = arr[i];
for(k = i;k>=j;--k)
{
arr[k] = arr[k-1];
}
arr[j] = tmp;
break;
}

}
}
}

void print(int * arr,int len)
{
int i = 0;
for(i=0; i<len; i++)
{
printf("%d ",arr[i]);
}
printf("/n");
}

/*find out a1 not in a2*/
void find_dif(int * a1, int * a2, int len_1, int len_2)
{
int i = 0,j = 0,k = 0;
for(i = 0; i<len_1; i++)
{
if(a1[i]<a2[j])
{
printf("%d ",a1[i]);
}
else if(a1[i]>a2[j])
{
i--;
j++;
}
}

}

int main()
{
int len = 10;
sort(arr1,len);
sort(arr2,len);
print(arr1,len);
print(arr2,len);
find_dif(arr1,arr2,len,len);
}