Answered: Rewrite these Jave methods to recursion…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Rewrite these Jave methods to recursion methods (no for looops)

public static void rotateL(int[] arr, int length, int num) {
for (int i = 0; i < num; i++) {
int j, first;
first = arr[0];
for (j = 0; j < arr.length - 1; j++) {
arr[j] = arr[j + 1];
}
arr[j] = first;
}
}

static boolean checkAscSort(int a[], boolean flag, int i, int n) {
for (i = 0; i < n - 1; i++) {
if (a[i] > a[i + 1]) {
flag = false;
break;
}
}
return flag;
}

static boolean checkDesSort(int a[], boolean flag, int i, int n) {
for (i = 0; i < n - 1; i++) {
if (a[i] < a[i + 1]) {
flag = false;
break;
}
}
return flag;
}

static boolean isEqual(int a[], boolean flag, int i) {
if (i == 0) {
for (i = 0; i < a.length - 1; i++) {
if (a[i] != a[i + 1]) {
flag = false;
}
}
return flag;
} else {
for (int k : a) {
if (k % 2 != 0) {
return false;
}
}
return true;
}

Expert Solution