int main(){
	int a[100],a2[100],a3[100],a4[100];
	int len;
	int i;
	printf("Enter the length of the array : ");
	scanf("%d",&len);
	
	for(i = 0 ; i< len ; i++){
		scanf("%d",&a[i]);
		a2[i] =a3[i] = a4[i]=a[i];
		
	}
	
	sort_1(&a[0],len);
	 
	
	sort_2(&a2[0],len);
	

	
	sort_3(&a3[0],len);
	

	
	sort_4(&a4[0],len);
	
	
	return 0;
}
Example #2
0
int main(void)
{
	int i,n,left,right,x;
	int list[MAX];
	printf("Enter the number of numbers to generate: ");
	scanf("%d",&n);
	if(n<1 ||n>MAX)
	{
		printf("Improper vaule of n\n");
		exit(1);
	}
	for(i=0;i<n;i++)
	{
		list[i]=rand()%100;
		printf("list[%d]=%d\n",i,list[i]);
	}
	sort_3(list,n);
	printf("\nsorted array:\n");
	for(i=0;i<n;i++)
		printf("%d  ",list[i]);
	printf("Enter the number you want to search : ");
	scanf("%d",&x);
	left=0;
	right=n-1;
	if(binsearch(list,x,left,right)!=-1)
		printf("It's in the array\n");
	else 
		printf("Sorry can't find it\n");
	printf ("数组的全排列\n");
	perm(list,0,n);
	return 0;
}