What is the worst time complexity of this code using big O notation?

void test5(int[] arr) {

if (arr.length%2==1){

for (int i = 0; i < arr.length; i++) {

System.out.println(arr[i]);

}

}

else{

for (int i = 1; i < arr.length; i++) {

arr[i] = arr[i-1];

int j=0;

while (j<=arr.length){

System.out.println(arr[j]);

j=j*2;

}

}

}

}