Bubble sort is the simplest sorting algorithm. In this technique we follow given step to short given elements in increasing order.
http://www.tutorial4us.com/data-structure/c-bubble-sort
Quick Sort, as the name indicate, sorts any list of data very quickly. Quick sort very fast data sorting technique and it requires very less additional space. It is based on the rule of Divide and Conquer(also called partition-exchange sort).
http://www.tutorial4us.com/data-structure/c-quick-sort
Bubble sort is the simplest sorting algorithm. In this technique we follow given step to short given elements in increasing order.
http://www.tutorial4us.com/data-structure/c-bubble-sort
Quick Sort, as the name indicate, sorts any list of data very quickly. Quick sort very fast data sorting technique and it requires very less additional space. It is based on the rule of Divide and Conquer(also called partition-exchange sort).
http://www.tutorial4us.com/data-structure/c-quick-sort
1. AIM : TO PERFORM SET OPERATIONS-UNION,INTERSECTION AND
DIFFRENCE,ETC.
*/
#include<stdio.h>
void main()
{
int a[15],b[15],c[15],m,n,i,j,k,x,flag;
printf("n enter the size of set A");
scanf("%d",&m);
printf("n enter the size of set B");
scanf("%d",&n);
printf("n enter the elements of set A");
for(i=0;i<m;i++)
{
scanf("%d",&a[i]);
}
printf("n enter the elments of set B");
for(j=0;j<n;j++)
{
scanf("%d",&b[j]);
}
k=0;
for(i=0;i<m;i++)
{