Tag Archives: data structures using c
Selection Sorting in C
#include<stdio.h> //Program for Selection Sorting int main() { int i,j,a[100],N,temp; printf(“Enter no.of elements you want to sort:\t”); scanf(“%d”,&N);//max no. of elements printf(“Enter %d elements you want to sort:\n”,N); for(i=0;i<N;i++) scanf(“%d”,(a+i)); printf(“\nBefore sorting:\t”); for(i=0;i<N;i++) printf(“%d\t”,*(a+i)); //Sorting Starts for(i=0;i<N-1;i++) for(j=i+1;j<N;j++) if(a[i]>a[j]) { … Continue reading
Bubble Sorting in C
#include<stdio.h> //Program for Bubble Sorting int main() { int i,j,a[100],N,temp; printf(“Enter no.of elements you want to sort:\t”); scanf(“%d”,&N);//Max. no. of elements printf(“Enter %d elements you want to sort:\n”,N); for(i=0;i<N;i++) scanf(“%d”,(a+i)); printf(“\nBefore sorting:\t”); for(i=0;i<N;i++) printf(“%d\t”,*(a+i)); //Sorting Starts for(i=0;i<N-1;i++) for(j=0;j<N-i-1;j++) if(a[j]>a[j+1]) { … Continue reading
Insertion Sorting
#include<stdio.h> //Program for Insertion Sorting int main() { int i,j,k,N,a[100],temp; printf(“Enter no. of elements you want to sort :\t”); scanf(“%d”,&N);//Max. no. of elements printf(“Enter %d elements you want to sort :\t”,N); for(i=0;i<N;i++) scanf(“%d”,(a+i)); printf(“\nBefore Sorting:\t”); for(i=0;i<N;i++) printf(“%d\t”,*(a+i)); //Sorting Process Start … Continue reading
