Question

Assignment: Write a program with each of the following methods. You can assume this program is saved in a file called multiArrays.java. A sample main method and sample output is provided at the end of this section. All arrays created are of integer-type.

1. Write a method to declare, initialize, and populate a two-dimensional array. Using the following header:

                        public static int[ ][ ] declare2D(Scanner scnr)

The user will indicate the size of the array.

2. Write a method to declare, initialize, and populate a three-dimensional array. Using the following header:

                        public static int[ ][ ][ ] declare3D(Scanner scnr)

The user will indicate the size of the array.

3. Write the following method that returns the location of the largest element in a two-dimensional array.

public static int[ ] locateLargest(int[ ][ ] a)

The return value is a one-dimensional array that contains two elements. These two elements indicate the row and column indices of the largest element in the two-dimensional array. The inputted array may be rectangular or ragged.

4. Write the following method that returns the location of the longest array in a three-dimensional array.

public static int[ ] locateLongest(int[ ][ ][ ] a)

The return value is a one-dimensional array that contains the longest array.

5. Write a method that shuffles the rows in a two-dimensional rectangular int array using the following header:

public static void shuffle(int[ ][ ] m)

6. Write a method to print the rows of a two-dimensional array, using the following header:

                        public static void print2D(int[ ][ ] m)

This array may be rectangular or ragged.                             

7. Write a method to print the rows of a three-dimensional array, using the following header:

public static void print3D(int[ ][ ][ ] m)

This array may be rectangular or ragged.

Finally, in your main method, using an array initializer, declare a two-dimensional ragged array (there are no restrictions on size, but it should be ragged, not rectangular). Using your print2D() method, print this ragged array.

I only need locateLargest, locateLongest, and shuffle

Answer 1

import java.util.Scanner;
class multiArrays{
    public static void main(String args[]){
        Scanner sc = new Scanner(System.in);
        int _2DArray[][] = declare2D(sc);
        int _3DArray[][][] = declare3D(sc);
        print2D(_2DArray);
        int[] largest_location = locateLargest(_2DArray);
        System.out.println("Largest element is "+_2DArray[largest_location[0]][largest_location[1]]);
        print3D(_3DArray);
        int[] largest_array = locateLongest(_3DArray);
        System.out.println("longest array is:");
        for(int i=0;i<largest_array.length;i++){
            System.out.print(largest_array[i]+" ");
        }

    }
    public static int[ ][ ] declare2D(Scanner sc){
        System.out.println("----------------Create 2D Array----------------");
        int r;
        System.out.print("Enter the number of rows in 2D array:");
        r=sc.nextInt();
        int[][] _2DArray = new int[r][];
        for (int i = 0;i<r;i++){
            System.out.print("Enter the number of elements in row "+(i+1)+":");
            int c=sc.nextInt();
            _2DArray[i]=new int[c];
            System.out.print("Enter the elements in row "+(i+1)+":");
            for(int j=0;j<c;j++){
                _2DArray[i][j]=sc.nextInt();
            }
        }
        return _2DArray;
    }
    public static int[ ][ ][ ] declare3D(Scanner sc){
        System.out.println("----------------Create 3D Array----------------");
        int r;
        System.out.print("Enter the number of rows in 3D array:");
        r=sc.nextInt();
        int[][][] _3DArray = new int[r][][];
        for (int i = 0;i<r;i++){
            System.out.print("Enter the number of columns in row "+(i+1)+":");
            int c=sc.nextInt();
            _3DArray[i]=new int[c][];
            for(int j=0;j<c;j++){
                System.out.print("Enter the number of elements in column "+(j+1)+":");
                int d=sc.nextInt();
                _3DArray[i][j]=new int[d];
                System.out.print("Enter the elements in column "+(j+1)+" of row "+(i+1)+":");
                for(int k = 0; k<d;k++) {
                    _3DArray[i][j][k] = sc.nextInt();
                }
            }
        }
        return _3DArray;
    }
    public static int[ ] locateLargest(int[ ][ ] a){
        int[] location  = new int[2];
        int max=-1;
        for(int i=0;i<a.length;i++){
            for(int j = 0;j<a[i].length;j++){
                if(a[i][j]>max) {
                    max = a[i][j];
                    location[0] = i;
                    location[1] = j;
                }
            }
        }
        return location;
    }
    public static int[ ] locateLongest(int[ ][ ][ ] a){
        int length = 0;
        int m=0;
        int n=0;
        for(int i = 0 ; i<a.length;i++){
            for(int j = 0 ; j<a[i].length;j++){
                if(length<a[i][j].length){
                    length = a[i][j].length;
                    m=i;
                    n=j;
                }
            }
        }
        int longest_array[] =new int[length];
        for(int i = 0;i<length;i++){
                longest_array[i] = a[m][n][i];
        }
        return longest_array;
    }
    public static void shuffle(int[ ][ ] m){

    }
    public static void print2D(int[ ][ ] m){
        for(int i=0;i<m.length;i++){
            for(int j = 0;j<m[i].length;j++){
                System.out.print(m[i][j]+" ");
            }
            System.out.println();
        }
    }
    public static void print3D(int[ ][ ][ ] m){
        for(int i=0;i<m.length;i++){
            for(int j = 0;j<m[i].length;j++){
                for(int k = 0;k<m[i][j].length;k++){
                    System.out.print(m[i][j][k]+" ");
                }
                System.out.println();
            }

        }
    }
}