C program to Add two 3X3 matrix

-

Addition of two 3X3 matrix

In this post i will share a c program with you that helps you to add 2 3X3 matrix.

So lets us check out the code :)



#include <stdio.h> 
#include <conio.h>
void main()
{
 int first[3][3],second[3][3],third[3][3],i,j;
 clrscr();
 printf("Elements of matrix A:\n ");
 for(i=0;i<3 a:="" a="" addition="" atrix="" b:="" d="" first="" for="" getch="" i="" j="" matrix="" n="" nelements="" of="" printf="" r="" scanf="" second="" third="">





















Happy Coding :)

Comments

Post a Comment

Popular posts from this blog

MultiSelection of Item in Recycler View

-
Image
Easiest Way to Implement Multi Selection of Item in Recycler View Hello friends, in this blog post I am going to show you that how one can make a multi selection functionality for items in the Recycler View So lets get started. First add the following dependencies to your project: dependencies { implementation fileTree(dir: 'libs', include: ['*.jar']) implementation"org.jetbrains.kotlin:kotlin-stdlib-jdk7:$kotlin_version" implementation 'androidx.appcompat:appcompat:1.0.2' implementation 'androidx.constraintlayout:constraintlayout:1.1.3' testImplementation 'junit:junit:4.12' androidTestImplementation 'androidx.test:runner:1.2.0' androidTestImplementation 'androidx.test.espresso:espresso-core:3.2.0' //Recycler View Dependency implementation 'androidx.recyclerview:recyclerview-selection:1.0.0' } Now in this project we have two XML layout file: For Main...
Read more

DFS(Depth First Search) & BFS(Breath First Search) in C

-
Image
DFS v/s BFS Depth First Search Depth First Search for a graph is similar to  Depth First Traversal of a tree . The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. Pseudocode: Input : A graph  G  and a vertex  v  of G Output : All vertices reachable from  v  labeled as discovered A recursive implementation of DFS:
Read more