Recursion · AP Computer Science A · Flashcards

QUESTION

Identify the base case in the function: boolean isPalindrome(String s, int start, int end) { if (start >= end) return true; else return s.charAt(start)==s.charAt(end) && isPalindrome(s, start+1, end-1); }

QUESTION

Identify the base case in the function: int fact(int n) { if (n==0) return 1; else return n*fact(n-1); }

QUESTION

Identify the recursive call in the function: int sum(int n) { if (n<=0) return 0; else return n+sum(n-1); }

Tap to flip before you grade