给两个数组和他们的大小，还有一动态开辟的内存，求交集，把交集放到动态内存dongtai，并且返回交集个数

#include 
   
   
    
     
#include 
    
    
     
     
int sort_function( const void *a, const void *b) 
{ 
	return int(*(long *)a - *(long *)b); 
} 

long jiaoji(long *a, long alen, long *b, long blen, long *c) 
{ 
	// 如果要保留数组a, 数组b,则在a,b进行拷贝中进行下操作 
	qsort((void *)a, alen, sizeof(long), sort_function); 
	qsort((void *)b, blen, sizeof(long), sort_function); 
	long *pa = a, *pb = b, *pc =c, clen=0; 
	long *ae = a+alen, *be = b+blen; 
	while( pa < ae && pb 
     
     
      
       *pb)
			pb++; 
		else 
			pa++; 
	} 
	return clen;	
} 


void main() 
{ 
	long a[] = { 8, 7, 1,2,3, 4, 6,}; 
	long b[] = { 6,7, 1, 2 }; 
	long c[4]; 
	long clen = jiaoji(a, 7, b, 4, c); 
	long *pc = c; 
	for(long i=0; i