-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSymmetric.java
More file actions
50 lines (46 loc) · 1.56 KB
/
Copy pathSymmetric.java
File metadata and controls
50 lines (46 loc) · 1.56 KB
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
49
50
import java.util.Scanner;
public class Symmetric {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter the number of rows : ");
int rows = sc.nextInt();
System.out.print("Enter the number of columns : ");
int columns = sc.nextInt();
if(rows!=columns){
System.out.println("The symmetric rule can only be applied to be square matrix ");
return;
}
int array [][] = new int[rows][columns];
System.out.println("Enter the elements of the array ");
for(int i =0; i<rows; i++){
for(int j =0; j<columns; j++){
array [i][j] = sc.nextInt();
}
}
System.out.println("The transpose of the matrix is ");
printTranspose(array, rows, columns);
if(isSymmetric(array, rows)){
System.out.println("The matrix is symmetric ");
}
else{
System.out.println("The given matrix is not symmetric ");
}
}
public static boolean isSymmetric(int[][] arr, int size){
for(int j =0; j<size; j++){
for(int i =0; i<size; i++){
if(arr[i][j] != arr[j][i])
return false;
}
}
return true;
}
public static void printTranspose(int arr[][] , int rows , int columns){
for(int j =0; j<columns; j++){
for(int i =0; i<rows; i++){
System.out.print(arr[i][j]+" ");
}
System.out.println();
}
}
}