Which of the following recursive methods would execute approximately log ₂ n times for an initial parameter n?
A) public void logcode(int n) {
If (n 1) logcode(n - 1);
}
B) public void logcode(int n) {
If (n 2) logcode(n - 2);
}
C) public void logcode(int n) {
If (n 0) logcode(0);
}
D) public void logcode(int n) {
If (n 1) logcode(n / 2);
}
E) public void logcode(int n) {
If (n 1) logcode(n - 1 /2);
}

Question

Which of the following recursive methods would execute approximately log ₂ n times for an initial parameter n?
A) public void logcode(int n) {
If (n > 1) logcode(n - 1);
}
B) public void logcode(int n) {
If (n > 2) logcode(n - 2);
}
C) public void logcode(int n) {
If (n > 0) logcode(0);
}
D) public void logcode(int n) {
If (n > 1) logcode(n / 2);
}
E) public void logcode(int n) {
If (n > 1) logcode(n - 1 /2);
}

Quizplus · Accepted Answer

D) This method recursively calls itself with n being half its original value. If n starts at 16, the second call has n = 8, the third has n = 4, the fourth has n = 2, the fifth and final call has n = 1. If n starts at 32, it adds one additional call. If we double n again, it only adds 1 more recursive call. This is a log ₂ n behavior.

Which of the Following Recursive Methods Would Execute Approximately Log