DATA STRUCTURE - C Codes
Description Program of insertion and deletion in B tree...In data structures, a B-tree is a tree data structure that keeps data sorted and allows searches, insertions, and deletions in logarithmic amortized time. Unlike self-balancing binary se ...
Description THIS CODE IS SIMPLE BUT NOT EASY TO WRITE SO PLEASE BEFORE RUNNING THE PROGRAM SEE THE CODE AND THEN RUN IF YOU DO'NT UNDERSTAND THEN SUMMIT QUERRY IN email address dwarikachandra@gmail.com Source Code <pre name="code" cl ...
Description Program for insertion in AVL tree...n Data Structure, an AVL tree is a self-balancing binary search tree, and it is the first such data structure to be invented. In an AVL tree, the heights of the two child subtrees of any node diff ...
Description This code is about all operations performed on linked list. Source Code #include<stdio.h> #include<conio.h> #include<alloc.h> struct list { int data; struct list *next; }; ...
Description This is a code which implements Bubble Sort Algorithm. Source Code #include<stdio.h> #include<stdlib.h> #include<conio.h> int item[100]; int a, b, t; int count; ...
Description An example of Shell Sort algorithm. Source Code #include <string.h> #include <stdio.h> #include <stdlib.h> void shell(char *items, int count) { int i, j, gap, k; ...
Description Quick Sort in Data Structures Using C Language. Source Code #include<stdio.h> #include<conio.h> void quick_sort(int array[], int first, int last) { int temp, low, high, li ...
Description This is a program for implementing 0-1 knapsack problem Source Code #include <stdio.h> #define MAXWEIGHT 100 int n = 3; /* The number of objects */ int c[10] = {8, 6, 4 ...
Description The insertion sort works just like its name suggests - it inserts each item into its proper place in the final list. The simplest implementation of this requires two list structures - the source list and the list into which sorted i ...
Description Merge Sort in Data Structure using C Language. Source Code # include<stdio.h> # include<stdlib.h> #include<conio.h> #include<malloc.h> void merge_sort(int *, in ...
Description Bubble Sort in Data Structures using C Language. Source Code #include <stdio.h> #include <stdlib.h> void bubble_sort(int array[], int size) { int temp, i, j; for ...
Description THIS IS THE SORTING MRTHOD TO SORT THE NUMBER Source Code #define NUMELTS 100 # include<stdio.h> #include<conio.h> #include<math.h> void radixsort(int a[],int); voi ...
Description A program to implement Heap Sort. Source Code #include<stdio.h> void restoreHup(int*,int); void restoreHdown(int*,int,int); void main() { int a[20],n,i,j,k; p ...
Description Heapsort (method) is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a good implementation of quicksort, it has the advantage of a worst-case ...
Description This is a program for demonstration of Tree Operations - INSERTION & INORDER, PREORDER, POSTORDER TRAVERSAL. Source Code # include<stdio.h> # include <conio.h> # include <allo ...
Description C Language: A QuickSort Example Program Source Code #define MAXARRAY 10 void quicksort(int arr[], int low, int high); int main(void) { int array[MAXARRAY] = {0}; int i = 0; // load some r ...
Description The selection sort works by selecting the smallest unsorted item remaining in the list, and then swapping it with the item in the next position to be filled. The selection sort has a complexity of O(n2).Pros: Simple and easy to impl ...
Description This program used to sort a String using Shaker Sort algorithm. Source Code #include <string.h> #include <stdio.h> #include <stdlib.h> void shaker(char *items, int count ...
Description This Program for demonstration of Tree Operations - INSERTION . INORDER . PREORDER . POSTORDER TRAVERSAL Source Code # include<stdio.h> # include <conio.h> # include <malloc.h&g ...
Description A variation of quick sort .it performs very well with time complexity of O(nlogn) always. it assures that in one pass 3 data will be sorted. Source Code #include<stdio.h> #include<co ...
Description it is stack using linkedlist implementation and defining push pop functions Source Code #include<stdio.h> #include<conio.h> #include<process.h> #define max 5 struct s ...
Description Insertion, Deletion and Traversal in Binary Search Tree...In Data Structures, a binary search tree (BST) is a binary tree data structure which has the following properties: * Each node (item in the tree) has a distinct valu ...
Description This code implements Queue with help of Linked List Source Code #include<stdio.h> #include<conio.h> #include<stdlib.h> struct node { int data; struct node *link; } ; ...
Description This code solves the Fractional Knapsack problem. Source Code #include <stdio.h> int n = 5; /* The number of objects */ int c[10] = {12, 1, 2, 1, 4}; /* c[i] is the *COST* of ...
Description In a circularly-linked list, the first and final nodes are linked together. This can be done for both singly and doubly linked lists. To traverse a circular linked list, you begin at any node and follow the list in either direction ...
Description defining the push and pop functions of stack using array implementation Source Code #include<stdio.h> #include<conio.h> #include<process.h> #define max 5 struct stude ...
Description Insertion & Deletion in a Binary Tree Source Code // Implementation Of BINARY TREE OPERATION (insertion & Deletion) #include<conio.h> #include<stdio.h> #include<malloc.h> ...
Description C Language: This is the code implementation of the Binary Tree Algorithm. Source Code #include<stdio.h> #include<conio.h> #include<malloc.h> #include<process.h> struct ...
Description n graph theory, a topological sort or topological ordering of a directed acyclic graph (DAG) is a linear ordering of its nodes in which each node comes before all nodes to which it has outbound edges. Every DAG has one or more topol ...
Description This code lets the user insert in a linked list Source Code #include<stdio.h> #include<conio.h> #include<malloc.h> struct node { int info; struct node *next; }; type ...
Description Doubly-linked list - A more sophisticated kind of linked list is a doubly-linked list or two-way linked list. Each node has two links: one points to the previous node, or points to a null value or empty list if it is the first node; ...
Description This is a Code which is used to impement CountSort Algorithm over a set of given numbers. Source Code #include <iostream.h> #include <stdio.h> #include <conio.h> void print( ...
Description C Language: Linear search program will search a no. whether present in array or not Source Code /*SEARCH*/ #include<stdio.h> main() { int m,i,j,t,n ...
Description Sorting of array by quick sort method...... It is the most accurate method to sort the given array by user...... Source Code #include<stdio.h> #include<conio.h> int n,k[50 ...
