//奇数排前，偶数排后
    public static void sortOdd(int[] data){
        int l = 0;
        int r = data.length - 1;

        while (l < r){
            while (l < r && data[r] % 2 == 0)
                r--;

            while (l < r && data[l] % 2 == 1)
                l++;

            Utils.swap(data,l,r);
        }
    }