Answer:
8155.63844394
Explanation:
Give a recursive algorithm for finding the sum of the first n odd positive integers.
1 answer:
You might be interested in
Answer:
Explanation:
The following program was written in Java. It creates a loop that asks the user for numbers. If it can convert it to an integer it accepts it and adds it to the sum variable otherwise it ouputs that it is not a valid number. Once all 10 integers are added it prints the Average of the values entered.
import java.util.ArrayList;
import java.util.Scanner;
class Brainly {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int count = 0;
int sum = 0;
while (count != 10) {
System.out.println("Enter a number: ");
String answer = in.nextLine();
try {
int intAnswer = Integer.parseInt(answer);
sum += intAnswer;
count += 1;
} catch (NumberFormatException e) {
System.out.println("Not a valid number.");
}
}
int average = sum / count;
System.out.println("Average: " + average);
}
}
