DSA

#include<stdio.h> #include<stdlib.h> #define MAX 20 void printsparse(int b[MAX][3]); void readsparse(int b[MAX][3]); void addsparse(int b1[MAX][3],int b2[MAX][3],int b3[MAX][3]); void main() {     int b1[MAX][3],b2[MAX][3],b3[MAX][3];     readsparse(b1);     readsparse(b2);     addsparse(b1,b2,b3);     printsparse(b3); } void readsparse(int b[MAX][3]) {     int i,t,m,n;     printf(“nEnter no. of rows and columns:”);     scanf(“%d%d”,&m,&n);     printf(“No. of non-zero triples:”);     scanf(“%d”,&t);     …

C Program for Addition of two Sparse Matrices Read More »

In this tutorial you will learn about double ended queue (dequeue) in C. What is Dequeue?  The word dequeue is short form of double ended queue. In a dequeue, insertion as well as deletion can be carried out either at the rear end or the front end. Also Read: Circular Queue in C Operations on a Dequeue …

Double Ended Queue (Dequeue) in C Read More »

Algorithm for concatenation Let us assume that the two linked lists are referenced by head1 and head2 respectively. 1. If the first linked list is empty then return head2. 2. If the second linked list is empty then return head1. 3. Store the address of the starting node of the first linked list in a …

Concatenation of two Linked Lists Read More »