Write a recursive method (count) that finds the number of occurrences of a speci

Question

Write a recursive method (count) that finds the number of occurrences of a specified character in an array. You need to define the following two methods. The second one is a recursive helper method.

public static int count(char[] chars, char ch)

public static int count(char[] chars, char ch, int high)

Write a test program (CharSearch) that prompts the user to enter a list of characters in one line, and then a character to count. Next, it displays the number of occurrences of the character in the list.

Explanation / Answer

Answer:

import java.util.Scanner;

class Program {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);
System.out.print("Enter a list of characters in one line: ");
String s = input.nextLine();
System.out.print("Enter a character: ");
char ch = input.next().charAt(0);

char[] chars = s.replaceAll(" ", "").toCharArray();
System.out.println("The occurrences of '" + ch + "' in "" + s + "" = " + count(chars, ch));
}

private static int count(char[] chars, char ch) {
return count(chars, ch, chars.length - 1);
}

private static int count(char[] chars, char ch, int high) {

int count = (chars[high] == ch) ? 1 : 0;

if (high == 0)
return count;
else
return count + count(chars, ch, high - 1);
}

}

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.