-
Notifications
You must be signed in to change notification settings - Fork 0
/
R_Sort.java
48 lines (41 loc) · 1.04 KB
/
R_Sort.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
R-Sort
Given an 2D array array , sort each row of the 2D array in ascending order.
Input Format : The first line consists of an integer N, which refers to the row size and column size of the matrix.
Next N lines follow the matrix.
Input Constraints : 1 <= N <= 500
1 <= Mat[i][j] <= 10^9
Output Format : N lines of output
Sample Input :
3
1 3 2
5 4 6
8 7 9
Sample Output :
1 2 3
4 5 6
7 8 9
*********************************
import java.util.*;
public class Main{
public static void main(String []args){
int n=0;
Scanner s=new Scanner(System.in);
n=s.nextInt();
long [][]a=new long[n][n];
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
a[i][j]=s.nextInt();}}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++)
{for(int k=0;k<n-1;k++){
if(a[j][k]>a[j][k+1]){
long t=a[j][k];
a[j][k]=a[j][k+1];
a[j][k+1]=t;
}}}}
for(int i=0;i<n;i++){for(int j=0;j<n;j++){
System.out.print(a[i][j]+ " ");}
System.out.println("");
}
}
}