Sorting – Bubble sort
Bubble sort: Two consecutive elements are compared. It sorts the elements in right to left fashion. Thus, (n-i) comparisons are made. Example: […]
Category: Data Structures using C Language
Sorting – Shell sort
Shell Sort: Shell sort is quite similar to that of insertion sort with the only difference that in shell sort, higher values […]
Indexed Sequential Search
Indexed Sequential Search: In this searching technique, first of all an index file is created that contains references to a group of […]
Hashing
HASHING Hashing: It is an effective search technique used to locate an element with search key value or an index. We begin […]
Graphs
Graphs Representation Adjacency Matrix Adjacency Lists Traversal schemes DFS (Depth First Search) Breadth First Search (BFS) Minimal Spanning Kruskal Prim Graph: A […]
Implementation of Adjacency List Representation for Graphs
Graphs Implementation of Adjacency List Representation for Graphs /*Implementation of Adjacency List Representation for graphs*/ #include <stdio.h> #include <conio.h> #include <string.h> #include […]
Program to sketch a Graph using Adjacency matrix
Graphs Program to sketch a Graph using Adjacency matrix /*Program to sketch a graph using adjacency matrix*/ #include <stdio.h> #include <conio.h> #include […]
Program to implement Graphs using Adjacency Matrix
Graphs Program to implement Graphs using Adjacency Matrix /*Implementation of adjacency matrix*/ #include <stdio.h> #include <conio.h> #include <string.h> #define MAX 4 typedef […]
Program to implement MIN Priority Queue
Priority Queue Program to implement MIN Priority Queue #include <stdio.h> #include <conio.h> #include <stdlib.h> #define MAX 10 struct queue {int front,rear; int […]
Program to implement MAX Priority Queue
Priority Queues Program to implement MAX Priority Queue #include <stdio.h> #include <stdlib.h> #include <conio.h> #define MAX 5 void display(struct queue *q); struct […]