C Program for Merge Sort

#include<stdio.h>#include<stdlib.h>int *a;void m_sort(int,int);void sort(int,int,int);main(){  int n,i;  printf("Enter the number of elements (it should be power of 2) ");  scanf("%d",&n);  a=(int *)calloc(n,sizeof(int));  printf("Enter the values ");  for(i=0;i<n;i++)  scanf("%d",a+i);  m_sort(0,n-1);  printf("The sorted array is \n");  for(i=0;i<n;i++)  printf("%d ",a[i]); ...

Continue

Example of Quick Sort

Written by Wyes #include<stdio.h>#include<stdlib.h>int *a;void quicksort(int,int);int partition(int,int);void swap_w(int,int);int random_partition(int,int);int random_number(int,int);main(){  int i,j,n;  printf("Enter the number of elements ");  scanf("%d",&n);  a=(int *)calloc(n,sizeof(int));  printf("Enter the elements\n");  for(i=0;i<n;i++)  scanf("%d",a+i);  quicksort(0,n-1); ...

Continue

Example of bubble sort

Written by Kousik /* c program for bubble sort*/#include<stdio.h>int a[20];void bubble(int n){   int t, i,j;   for(j=n-1;j>0;j++)   {    for(i=0;i<j;i++) { if(a[i+1]>a[i]) {  t=a[i];  a[i]=a[i+1];  a[i+1]=t; } }   }}int main(){  int n,i;  printf("Enter the total number of elements: ");  scanf("%d",&n);  printf("Enter the values: "); ...

Continue