王道8.3综合应用题3

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int partition(int A[],int low,int high){
	int temp=A[low];
	while(low<high){
		while(A[high]%2==0 && low<high){
			high--;
		}
		A[low]=A[high];
		while(A[low]%2!=0 && low<high){
			low++;
		}
		A[high]=A[low];
	}
	A[low]=temp;
	return low;
}
void Sort(int A[],int low,int high){
	if(low<high){
		int num = partition(A,low,high);
		Sort(A,low,low-1);
		Sort(A,low+1,high);
	}
}

 
void Printf(int A[],int n){
	for(int i=0;i<n;i++){
		printf("%d ",A[i]);
	}
	printf("\n");
}
int main(){
	int A[11]={6,7,8,5,1,4,2,3,15,7,6};
	int n=11;
	Sort(A,0,n-1);
	Printf(A,n);
	
	
	return 0; 
}