void Move(Seqlist &L){
int low=0,high=L.length-1;
while(low<high){
while(low<high&&A.data[high]>=0)
high--;
while(low<high&&A.data[low]>0)
low++;
Swap(A.data[high],A.data[low]);
}
}
#define MaxSize 100
typedef struct{
int data[MaxSize];
int length;
}Seqlist;
void Swap(int &a,int &b){
int temp=a;
a=b;
b=temp;
}
有点类似快速排序的Partition