Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import java.util.Scanner;
- public class MaxAndMin {
- public static void main(String []args) {
- Scanner scan = new Scanner(System.in);
- System.out.print("Enter the size of the array: ");
- int sizeOfArray = scan.nextInt();
- while (sizeOfArray <= 0) {
- System.out.println("Size input is invalid.");
- System.out.print("Enter the size of the array: ");
- sizeOfArray = scan.nextInt();
- }
- int[] theArray = new int[sizeOfArray];
- for (int i = 0; i < theArray.length; i++) {
- System.out.print("Enter integer to be added to array: ");
- theArray[i] = scan.nextInt();
- }
- System.out.printf("\nThe largest number in the array is %,d\n", findMax(theArray));
- System.out.printf("The index of largest number in the array is %,d\n",
- indexOfMax(theArray));
- System.out.printf("The smallest number in the array is %,d\n", findMin(theArray));
- System.out.printf("The index of smallest number in the array is %,d", indexOfMin(theArray));
- }
- public static int findMax(int[] someArray) {
- int largestInArray = someArray[0];
- for (int element : someArray) {
- if (largestInArray < element) {
- largestInArray = element;
- }
- }
- return largestInArray;
- } // end findMax()
- public static int indexOfMax(int[] someArray) {
- int pos = 0;
- for (int i = 0; i < someArray.length; i++) {
- pos = someArray[i] > someArray[pos] ? i : pos;
- }
- return pos;
- } // end indexOfMax()
- public static int findMin(int[] someArray) {
- int smallestInArray = someArray[0];
- for (int element : someArray) {
- if (smallestInArray > element) {
- smallestInArray = element;
- }
- }
- return smallestInArray;
- } // end findMin()
- public static int indexOfMin(int[] someArray) {
- int pos = 0;
- for (int i = 0; i < someArray.length; i++) {
- pos = someArray[i] < someArray[pos] ? i : pos;
- }
- return pos;
- } // end indexOfMin()
- } // end class
Advertisement
Add Comment
Please, Sign In to add comment