How do I check the case when the user enters an index that is negative, or lastindex > firstindex for the methods in java? code: import java.util.Scanner; public class Grades { public static int readGrades() { int grade=0; Scanner input = new Scanner(System.in); System.out.println("Enter a grade : "); grade=input.nextInt(); return count++; } public static int sum(int[] arr) { int grade_sum=0; for(int i=0;iarr[i]) { min=arr[i]; } } return min; } public static int minValue(int[] arr, int firstIndex, int lastIndex) { int min=arr[0]; for(int i=firstIndex;i<=lastIndex;i++) { if(min>arr[i]) { min=arr[i]; } } return min; } public static int indexOfFirstMinValue(int[] arr) { int min=0; for(int i=0;iaverage(arr)) { count++; } } return count; } public static void rotateElements(int[] arr) { int i, temp; temp = arr[0]; for (i = 0; i < arr.length - 1; i++) { arr[i] = arr[i + 1];} arr[arr.length-1] = temp; System.out.print("\nRotated array is: \n"); for (int k = 0; k < arr.length; k++) { System.out.print(arr[k]+" "); } } public static void rotateElements(int[] arr, int rotationCount) { for (int i = 0; i < rotationCount; i++) rotateElements(arr); System.out.print("\nRotated array is: \n"); for (int k = 0; k < arr.length; k++) { System.out.print(arr[k]+" "); } } public static void reverseArray(int[] arr) { int n= arr.length; int[] b = new int[n]; int j = n; for (int i = 0; i < n; i++) { b[j - 1] = arr[i]; j = j - 1; } System.out.print("\nReversed array is: \n"); for (int k = 0; k < n; k++) System.out.print(b[k]+" "); } public static void main(String[] args) { int grade[]=new int[5]; int i=0; grade[0]=0; Scanner input = new Scanner(System.in); while(true) { System.out.print("Enter a grade: "); grade[i]=readGrades(); if(grade[i]!=-1) //if(grade != 0){ break; else count++; } } System.out.println("The maximum grades is: "+maxValue(grade)); System.out.println("The minimum grades is: "+minValue(grade)); } }
How do I check the case when the user enters an index that is negative, or lastindex > firstindex for the methods in java?
code:
import java.util.Scanner;
public class Grades {
public static int readGrades() {
int grade=0;
Scanner input = new Scanner(System.in);
System.out.println("Enter a grade : ");
grade=input.nextInt();
return count++;
}
public static int sum(int[] arr) {
int grade_sum=0;
for(int i=0;i<arr.length;i++)
grade_sum=grade_sum+arr[i];
return grade_sum;
}
public static int sum(int[] arr, int firstIndex, int lastIndex) {
int grade_sum=0;
for(int i=firstIndex;i<=lastIndex;i++)
grade_sum=grade_sum+arr[i];
return grade_sum;
}
public static double average(int[] arr) {
double sum=sum(arr);
return ((float)sum/(float)(arr.length));
}
public static int maxValue(int[] arr) {
int max=0;
for(int i=0;i<arr.length;i++) {
if(max<arr[i]) {
max=arr[i];
}
}
return max;
}
public static int maxValue(int[] arr, int firstIndex, int lastIndex) {
int max=0;
for(int i=firstIndex;i<=lastIndex;i++) {
if(max<arr[i]) {
max=arr[i];
}
}
return max;
}
public static int indexOfFirstMaxValue(int[] arr) {
int max=0;
for(int i=0;i<arr.length;i++) {
if(maxValue(arr)==arr[i]) {
max=i;
}
}
return max;
}
public static int minValue(int[] arr)
{
int min=arr[0];
for(int i=1;i<arr.length;i++) {
if(min>arr[i]) {
min=arr[i];
}
}
return min;
}
public static int minValue(int[] arr, int firstIndex, int lastIndex) {
int min=arr[0];
for(int i=firstIndex;i<=lastIndex;i++) {
if(min>arr[i]) {
min=arr[i];
}
}
return min;
}
public static int indexOfFirstMinValue(int[] arr) {
int min=0;
for(int i=0;i<arr.length;i++) {
if(minValue(arr)==arr[i]) {
min=i;
}
}
return min;
}
public static int numberOfBelowAverageElements(int[] arr) {
int count=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]<average(arr)) {
count++;
}
}
return count;
}
public static int numberOfAboveAverageElements(int[] arr) {
int count=0;
for(int i=0;i<arr.length;i++) {
if(arr[i]>average(arr)) {
count++;
}
}
return count;
}
public static void rotateElements(int[] arr) {
int i, temp;
temp = arr[0];
for (i = 0; i < arr.length - 1; i++) {
arr[i] = arr[i + 1];}
arr[arr.length-1] = temp;
System.out.print("\nRotated array is: \n");
for (int k = 0; k < arr.length; k++) {
System.out.print(arr[k]+" ");
}
}
public static void rotateElements(int[] arr, int rotationCount) {
for (int i = 0; i < rotationCount; i++)
rotateElements(arr);
System.out.print("\nRotated array is: \n");
for (int k = 0; k < arr.length; k++) {
System.out.print(arr[k]+" ");
}
}
public static void reverseArray(int[] arr) {
int n= arr.length;
int[] b = new int[n];
int j = n;
for (int i = 0; i < n; i++) {
b[j - 1] = arr[i];
j = j - 1;
}
System.out.print("\nReversed array is: \n");
for (int k = 0; k < n; k++)
System.out.print(b[k]+" ");
}
public static void main(String[] args) {
int grade[]=new int[5];
int i=0;
grade[0]=0;
Scanner input = new Scanner(System.in);
while(true) {
System.out.print("Enter a grade: ");
grade[i]=readGrades();
if(grade[i]!=-1)
//if(grade != 0){
break;
else
count++;
}
}
System.out.println("The maximum grades is: "+maxValue(grade));
System.out.println("The minimum grades is: "+minValue(grade));
}
}
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 5 images
