Implementing String Algorithms Practice Test

Problem: Sort an array of strings in lexicographical order using selection sort. Input: String[] words (length 1–200) where each word length is 0–50. Output: the same array sorted ascending. No external libraries. Function signature: public static void selectionSort(String[] words). Given the problem description above, how many iterations will the outer loop execute for input of length n?

Problem: Write public static int countChar(String inputString, char target) that counts occurrences of target in inputString using a loop. Input: a string and a character. Output: count as an int. Example: ("mississippi", 's') -> 4. Constraints: $0 \le$ length $\le 10^5$. Given the problem description above, which function signature matches the problem requirements?