Prime Sieve Implementation

What is wrong in my code because it is not giving any output…

package NumberTheory;
/*
find prime num between 1-n
*/
public class primeSeive {
//Optiml prime seive
static void optimalPrimeSeive(int n1,int n2)
{
int arr[]=new int[n2];

    for(int i=0;i<arr.length;i++)
    {
        arr[i]=1;
    }
    arr[0]=0;
    arr[1]=0;
    for(int i=4;i<arr.length;i+=2)
    {
        arr[i]=0;
    }
    
    for(int i=3;i<arr.length;i=+2)
    {
        if(arr[i]==1)
        {
             for(int j=i*i;j<arr.length;j=j+i)
            {
                arr[j]=0;
            }
        }
    }
    for(int i=2;i<arr.length;i++)
    {
        if(arr[i]==1)
        {
            System.out.print(" "+(i));
        }
    }
}
public static void main(String[] args) {
   
    optimalPrimeSeive(1,10);
    
}

}