Here you will learn about Dijkstra’s algorithm and how you can implement it in C programming. Dijkstra algorithm is also called the single source shortest path algorithm. It is based on the greedy technique. The algorithm maintains a list visited[ ] of vertices, whose shortest distance from the source is already known. If visited[1], equals 1, then the …
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 »
B-tree is another very popular search tree. The node in a binary tree like AVL tree contains only one record. AVL tree is commonly stored in primary memory. In database application, where huge volume of data is handled, the search tree cannot be accommodated in primary memory. B-trees are primarily meant for secondary storage. A …
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 …
