# Category: Java

## The maximum-valued element of an integer -valued array can be recursively calculated as follows

1

LANGUAGE: JAVA CHALLENGE: The maximum-valued element of an integer -valued array can be recursively calculated as follows: • If the array has a single element , that is its maximum (note that a zero-sized array has no maximum) • Otherwise, compare the first element with the maximum of the rest of the array — whichever […]

## The Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, has as its first 2 values, 0 and 1;

LANGUAGE: JAVA CHALLENGE: The Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, has as its first 2 values, 0 and 1; each successive value if then calculated as the sum of the previous two values. The first element in the series is the 0’th element , thus the value 8 is element […]

## Assume the availability of a method named makeLine that can be passed a non-negative integer n and a character c and return a String consisting of n identical characters that are all equal to c.

1

LANGUAGE: JAVA CHALLENGE: Assume the availability of a method named makeLine that can be passed a non-negative integer n and a character c and return a String consisting of n identical characters that are all equal to c. Write a method named printTriangle that receives two integer parameters n and k. If n is negative […]

## Write the definition of a method named printPowerOfTwoStars that receives a non-negative integer n and prints a string consisting of “2 to the n” asterisks.

LANGUAGE: JAVA CHALLENGE: Write the definition of a method named printPowerOfTwoStars that receives a non-negative integer n and prints a string consisting of “2 to the n” asterisks. So, if the method received 4 it would print 2 to the 4 asterisks, that is, 16 asterisks: **************** and if it received 0 it would print […]