Singly Linked List Theory
Generally a Linked List means "Singly Linked List". It is a chain of records known as…
Generally a Linked List means "Singly Linked List". It is a chain of records known as…
//Singular Linked List #include<stdio.h> #include<conio.h> #include<stdlib.…
//Removing duplicate values from an array #include<stdio.h> #include<conio.h> …
//Inserting an element at any position in Array #include<stdio.h> #include<conio.h…
#include<stdio.h> void main() { auto int i=1; //automatic storage variabl…
#include<stdio.h> void main() { auto int i //automatic storage variable i…
#include<stdio.h> void main() { auto int i //automatic storage variable i…
#include<stdio.h> void main() { auto int i=100; printf("i=%d\n",i); //1…
//program to demonstrate printing of string #include<stdio.h> #include<conio.h>…
//program to demonstrate printing of string #include<stdio.h> #include<conio.h>…
//program to demonstrate printing of string #include<stdio.h> #include<conio.h>…
//to print ASCII value of characters #include<stdio.h> #include<conio.h> void …
//simple program using array #include<stdio.h> #include<conio.h> void main() …
//Calculator without Switch #include<stdio.h> #include<conio.h> void main() {…
//program to print the division #include<stdio.h> #include<conio.h> void main…
//program to interchange matrix row into column #include<stdio.h> #include<conio.h…
//matrix value printing /* 1 2 3 4 5 6 7 8 9 */ #include<stdio.h> #include<…
// Queue #include<stdio.h> #include<conio.h> #define MAX 5 int ch,front=-1,re…
//Binary Search #include<stdio.h> #include<conio.h> void main() { int a[100…
//Merge Sort #include<stdio.h> #include<conio.h> #define MAX 100 void main() …
// Swapping: Call by value #include<stdio.h> #include<conio.h> void main() { …
//Swapping: call by reference #include<stdio.h> #include<conio.h> void main() …
//Insert and delete any number from array #include<stdio.h> #include<conio.h> #…
#include<stdio.h> #include<conio.h> #define SIZE 4 int ch,top=-1,stack[SIZE],it…
Heap Sort Overview: ž Uses a heap as its data structure ž In-place sorting algori…
//Stack #include<stdio.h> #include<conio.h> #define SIZE 4 int ch,top=-1,stac…