Data Structures and Algorithms in Java[1].pdf - Fulvio Frisone

Write a recursive Java program that will output all the subsets of a set of n
elements (without repeating any subsets).
C-3.15
Write a short recursive Java method that finds the minimum and maximum
values in an array of int values without using any loops.
C-3.16
Describe a recursive algorithm that will check if an array A of integers contains
an integer A[i] that is the sum of two integers that appear earlier in A, that is,
such that A[i] = A[j] +A[k] for j,k > i.
C-3.17
Write a short recursive Java method that will rearrange an array of int values
so that all the even values appear before all the odd values.
C-3.18
Write a short recursive Java method that takes a character string s and outputs
its reverse. So for example, the reverse of "pots&pans" would be
"snap&stop".
C-3.19
Write a short recursive Java method that determines if a string s is a palindrome,
that is, it is equal to its reverse. For example, "racecar" and
"gohangasalamiimalasagnahog" are palindromes.
C-3.20
Use recursion to write a Java method for determining if a string s has more
vowels than consonants.
C-3.21
Suppose you are given two circularly linked lists, L and M, that is, two lists of
nodes such that each node has a nonnull next node. Describe a fast algorithm for
telling if L and M are really the same list of nodes, but with different (cursor)
starting points.
C-3.22
Given a circularly linked list L containing an even number of nodes, describe
how to split L into two circularly linked lists of half the size.
209