Answer to Question #58532 in Java | JSP | JSF for udayanga

Question

3.3 Write a recursive pseudo code algorithm that returns the maximum among the first n elements of an array.


3.4 Write a recursive algorithm that prints all the permutations of the first n characters of a string. For example the call print (“ABC”, 3) would print

ABC, ACB, BAC, BCA, CBA, CAB

3.5 Implement the algorithms written in part 3.3 and 3.4 in Java Language.