Answered step by step
Verified Expert Solution
Question
1 Approved Answer
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
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;
}
}
}
}
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started