Write a program to create a two-dimensional array of integers (3 by 5) and then accept user inputs to fill the array. First: find out the column with the largest sum, and swap corresponding values in this column with the first column. Second: find out the column with the smallest sum, and swap corresponding values in this column with the last column (as following sample output shows). Hint1: if by chance, in the beginning, the column with the largest sum has happened in the first column; or the column with the smallest sum has happened in the last column: we need not touch the array and swap the values. Hint2: if by chance, in the beginning, there are more than 1 column with the same largest or smallest sum, you are free to choose either of them to do the swapping. (Use Java coding language).
Write a program to create a two-dimensional array of integers (3 by 5) and then accept user inputs to fill the array. First: find out the column with the largest sum, and swap corresponding values in this column with the first column. Second: find out the column with the smallest sum, and swap corresponding values in this column with the last column (as following sample output shows). Hint1: if by chance, in the beginning, the column with the largest sum has happened in the first column; or the column with the smallest sum has happened in the last column: we need not touch the array and swap the values. Hint2: if by chance, in the beginning, there are more than 1 column with the same largest or smallest sum, you are free to choose either of them to do the swapping. (Use Java coding language).
![3- Write a program to create a two-dimensional array of integers (3
by 5) and then accept user inputs to fill the array. First: find
out the column with the largest sum, and swap corresponding values
in this column with the first column. Second: find out the column
with the smallest sum, and swap corresponding values in this column
with the last column (as following sample output shows).
Hint1: if by chance, in the beginning, the column with the largest
sum has happened in the first column; or the column with the
smallest sum has happened in the last column: we need not touch
the array and swap the values.
Hint2: if by chance, in the beginning, there are more than 1 column
with the same largest or smallest sum, you are free to choose
either of them to do the swapping.
Sample output:
Initial format:
6
3
-50 25
18 -5 34
1
8
2
11
After swapping:
-7
-2 3
1
34
28
-26 23 28 3
0
5
25
-5
1
8
2
-2
0
5
3 23 11
6
-50
18
-26](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa6a239af-21a2-437f-8e06-242c22e0703e%2Ffd744233-feb7-4599-8686-a29ba23814a5%2F8lwj6nb_processed.png&w=3840&q=75)
![](/static/compass_v2/shared-icons/check-mark.png)
The question is to write JAVA code for the given problem.
Step by step
Solved in 2 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
![Starting Out with Python (4th Edition)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)