Could also be done recursive, I guess?
boolean isEven(int n) {
if (n == 0) {
return true;
} else {
return !isEven(Math.abs(n - 1));
}
}
Could also be done recursive, I guess?
boolean isEven(int n) {
if (n == 0) {
return true;
} else {
return !isEven(Math.abs(n - 1));
}
}
I think both (counting from the top) number 2 and 4 are placed correctly.