将一个数组按前偶后奇数排列算法复杂度要求O(n)

public static void  main(String [] args){
        int [] arr={4,5,5,1,2,3,6};
        int [] brr=new int[arr.length];
        int bindex=0;
        int blIndex=arr.length;
        for(int i=0;i<arr.length;i++){
            if(arr[i] % 2 == 0){
                brr[bindex]=arr[i];
                bindex++;
            }
            else{
                blIndex -- ;
                brr[blIndex]=arr[i];
            }
        }
        arr=brr;
        for(int i=0;i<arr.length;i++){
            System.out.println(arr[i]);
        }

    }