【2 线性表】奇偶数划分先后，奇在前偶在后。

void partition(int A[],int n){
	int low=0,high=n-1;
	while(low<high){
		while(low<high&&A[high]%2==0)
			high--;
		A[low]=A[high];
		while(low<high&&A[low]%2==1)
			low++;
		A[high]=A[low];
	}
}