We can print the source code of a program as an output using quine. So first lets understand what quine is? What is a Quine? A quine is a computer program which takes no input and produces a copy of its own source code as its only output. The standard terms for these programs in …
C Program to print its own Source Code as Output Read More »
In this tutorial, you will learn about Depth First Search in C with the algorithm and program examples. Most graph problems involve the traversal of a graph. Traversal of a graph means visiting each node and visiting exactly once. There are two types of traversal in graphs i.e. Depth First Search (DFS) and Breadth First Search (BFS). Also …
Adjacency Matrix A graph G = (V, E) where v= {0, 1, 2, . . . n-1} can be represented using two dimensional integer array of size n x n. int adj[20][20] can be used to store a graph with 20 vertices adj[i][j] = 1, indicates presence of edge between two vertices i and j. …
Representation of Graphs: Adjacency Matrix and Adjacency 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 …
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 …
#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); …
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 …
In this tutorial you will learn about program and algorithm for infix to postfix conversion in C with an example. In infix notation or expression operators are written in between the operands while in postfix notation every operator follows all of its operands. Example: Infix Expression: 5+3*2 Postfix Expression: 5 3 2*+. Infix …
Infix to Postfix Conversion in C [Program and Algorithm] Read More »
