写一个函数，要求对一个整数数组重新排序，使奇数总是在偶数的前面位置

C# codes as blow:

 

        static int[] Method(int[] array)
        {
            while(array==null || array.Length==0)
                return array;

            int i=0;
            int j=array.Length-1;

            while (i < j)
            {
                while (array[i] % 2 == 1 && i < array.Length - 1)
                    i++;

                while (array[j] % 2 == 0 && j > 0)
                    j--;

                if (i < j)
                {
                    int number = array[i];
                    array[i] = array[j];
                    array[j] = number;
                }
            }

            return array;
        }