Symentic Matrix Using Python

What is Symmetric Matrix?

A=[1 2]

[2 1] is a Square Matrix . When We Modify The Given Matrix Row Into Column And Column Into Row. if Modified and Original Matrix Array Are Same It Known As Symmetric Matrix.

If A=A'

A=[1 2] A'=[1 2]

[2 1] is Equal To [2 1]

Other Wise Given Matrix is Non Symmetric.

The Follow Simple Python Code For Find The Given Array Is Symmetric or Not.

arr=[[1,2],[2,1]]

n=len(arr[0])

m=len(arr)

isTrue=1

for i in range(0,n):

for j in range(0,m):

if(arr[i][j]!=arr[j][i]):

isTrue=0

break;

print(isTrue)

output:

Time Complexity o(n^2).

Comment Your solutions.

Comments

For() - Basic Programming Concepts With psudo Code

for is an looping statement.it used to execute the tast until reach the condition. syntax for(installation,condition,increment or decrement) { //statements or block of code. } example, main() { int i; for(i=1;i<=10;i++) { printf("\n %d",i); } }

Class is a collection of similar objects. Which have common properties

Class is a collection of similar objects. Which have common properties. Syntax class class_name { //member functions and variables. } How to create a objects for class class_name c=new class_name; We can access the member variable and member methods using dot operator. c.member_function(); Eg : class bike { void fun() { System.out.println("member method"); } public static void main(String[] args) { bike B=new bike(); B.fun(); } } output member method

LPS(Longest Prefix Which Is Also Suffix) Array Generation Using Java

import java.util.* ; //Longest Prefix Which Is Also Suffix Which Is Used To Found a Pattern Through Avoid Repeated Characters in Given String. We Will Discuss KMP ALGORITHM TO Find A Pattern In Given String Latter. class lbs{ public static void main( String [] args){ Scanner in= new Scanner(System.in); //Get Input From User String s=in.nextLine(); //Convert String Into Char Array char [] ch=s.toCharArray(); int n=s.length(); int [] lbsArr= new int [n]; int j= 0 ,i= 1 ; lbsArr[ 0 ]= 0 ; //LPS ARRAY ALGORITHM /* i=1; j=0; string s="aaab" while i<n if s[i]==s[j]: lpsArr[i]=j; j=j+1 i=i+1 else: if j==0: lbsArr[j]=0 i=i+1 else: ...

javacpp

Search This Blog