bool fun(int value)
35 {
36 return ((value & 1)==0);
37 }
38
39 void show(int arr[],int length)
40 {
41 int i=0;
42 for(;i<length;++i)
43 cout<<arr[i]<<" ";
44 cout<<endl;
45 }
46 void Recoder(int arr[],int length)
47 {
48 if(arr==NULL || length==0)
49 return;
50 int *pstart=arr;
51 int *pend=arr+length-1;
52 while(pstart < pend)
53 {
54 while(pstart < pend && !fun(*pstart))
55 pstart++;
56 while(pstart < pend && fun(*pend))
57 pend--;
58 if(pstart < pend)
59 {
60 int tmp=*pstart;
61 *pstart=*pend;
62 *pend=tmp;
63 }
64 }
65 show(arr,length);
66 }
67 int main()
68 {
69 int arr[]={1,2,3,4,5,6,7,8,9,10};
70 int length=sizeof(arr)/sizeof(*arr);
71 Recoder(arr,length);
72 return 0;
73 }
数组中将所有奇数排到偶数前面
最新推荐文章于 2021-08-21 09:41:10 发布