Polynomial addition, multiplication (8th degree polynomials) using arrays #include<math.h> #include<stdio.h> #include<conio.h> #define MAX 17 void init(int p[]); void read(int p[]); void print(int p[]); void add(int p1[],int p2[],int p3[]); void multiply(int p1[],int p2[],int p3[]); /*Polynomial is stored in an array, p[i] gives coefficient of x^i .   a polynomial 3x^2 + 12x^4 will be represented as …

C Program for Addition and Multiplication of Polynomial Using Arrays or Linked List Read More »

In this tutorial, you will get program for merge sort in C.   Merge sort runs in O (n log n) running time. It is a very efficient sorting data structure algorithm with near optimal number of comparisons. Recursive algorithm used for merge sort comes under the category of divide and conquer technique. An array of …

Program for Merge Sort in C Read More »

Here you will get program for AVL tree in C. An AVL (Adelson-Velskii and Landis) tree is a height balance tree. These trees are binary search trees in which the height of two siblings are not permitted to differ by more than one. i.e. [Height of the left subtree – Height of right subtree] <= 1. A …

Program for AVL Tree in C Read More »

#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 »