Two methods of non-opening redundant space for odd-even ordering of digital arrays

#include <stdio.h>//#include <stdlib.h>//void  jo (int arr[], int len)//{/ /int value;//int i,j;//for  (i = 0; i < len; i++)//{//if  ( arr[i] % 2 == 0)//{//value = arr[i];//for  (j = i; j  < len; j++)//{//if  (arr[j] % 2 != 0)//{//arr[i] = arr[j];//arr [J] = value;//break;//}//}//}//}//}//void  jo (Int arr[],int len)//{//int i= 0;//int j=len-1;//int m=0;//while (i<j)//{//while (arr[i]%2!=0&&i<j)//i++;//while (Arr[j] %2==0&AMP;&AMP;I&LT;J)//j--;//if (i<j)//{//m=arr[j];//arr[j]=arr[i];//arr[i]=m;//}//}//}//int main ()//{ int arr[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9,  0 };//int len = sizeof (arr)  / sizeof (arr[0]);//int i = 0;//jo (arr ,  len);/for  (i = 0; i<len; i++)//{//printf ("%d:%d\n",  i, arr[i]);//}//system (" Pause ");//return 0;//}

This article is from the "Small Stop" blog, please be sure to keep this source http://10541556.blog.51cto.com/10531556/1691926

Two methods of non-opening redundant space for odd-even ordering of digital arrays