Arrange the list of numbers in ascending order using Heap Sort.
Program: #include<stdio.h> #include<conio.h> void Heapsort(int[],int); int Parent(int)…
Explore more »
the list of numbers in ascending order using Radix Sort.
Program: #include<stdio.h> #include<conio.h> void Radixsort(int[],int); void main() {…
Explore more »
Arrange the list of numbers in ascending order using Quick Sort.
Program: #include<stdio.h> #include<conio.h> void Quicksort(int[],int,int); int partit…
Explore more »
Arrange the list of numbers in ascending order using Merge Sort.
Program: #include<stdio.h> #include<conio.h> void Mergesort(int[],int,int); void Merg…
Explore more »
Arrange the list of numbers in ascending order using Selection Sort.
Program: #include<stdio.h> #include<conio.h> void Selectionsort(int[],int); void main…
Explore more »
Arrange the list of numbers in ascending order using Insertion Sort.
Program: #include<stdio.h> #include<conio.h> void Insertionsort(int[],int); void main(…
Explore more »
Arrange the list of numbers in ascending order using Bubble Sort.
Program: #include<stdio.h> #include<conio.h> void Bubblesort(int[],int); void main() {…
Explore more »
To Search an element using binary search.
Program: #include<stdio.h> #include<conio.h> int Binarysearch(int[],int,int); void ma…
Explore more »
To Search an element using sequential search.
Program: #include<stdio.h> #include<conio.h> int Sequentialsearch(int[],int,int); void …
Explore more »
Implementation of binary search tree using array.
Program: #include<stdio.h> #include<conio.h> #include<stdlib.h> #define TRUE 1 …
Explore more »
Implementation of circular queue using array.
Program: #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAXQ 100…
Explore more »
Implementation of stack using array.
Program: #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAXSTK …
Explore more »
Implementation of queue using array.
Program: #include<stdio.h> #include<conio.h> #include<stdlib.h> #define MAXQ 100…
Explore more »
Calculate factorial of a number using recursive function.
Program: #include<stdio.h> #include<conio.h> int Factorial(int); void main() { int i,n…
Explore more »
To Create fibonacci series using recursive function.
Program: #include<stdio.h> #include<conio.h> int Fibonacci(int); void main() { int i,n…
Explore more »
Implementation of linked list using array.
Program: #include<stdio.h> #include<conio.h> #define TRUE 1 #define SIZE 10 struct lin…
Explore more »
To copy a string into another string.
Program: #include<stdio.h> #include<conio.h> #include<string.h> void main() { c…
Explore more »
To Concatenate two string.
Program: #include<stdio.h> #include<conio.h> #include<string.h> void main() { ch…
Explore more »
To multiply two matrix A and B.
Program: #include<stdio.h> #include<conio.h> void main() { int i,j,m,n,p,q,k; int a[10…
Explore more »
To add two matrix A and B.
Program: #include<stdio.h> #include<conio.h> void main() { int i,j,m,n,p,q; int a[10][…
Explore more »