#include<stdio.h> int main(){ int i, j, count, temp, number[25]; printf(“How many numbers u are going to enter?: “); scanf(“%d”,&count); printf(“Enter %d elements: “, count); for(i=0;i<count;i++) scanf(“%d”,&number[i]); for(i=1;i<count;i++){ temp=number[i]; j=i-1; while((temp<number[j])&&(j>=0)){ number[j+1]=number[j]; j=j-1; } number[j+1]=temp; } printf(“Order of Sorted elements: “); for(i=0;i<count;i++) printf(” %d”,number[i]); return 0; }
#include<stdio.h> int main(){ int i, j, count, temp, number[25]; printf(“How many numbers u are going to enter?: “); scanf(“%d”,&count); printf(“Enter %d elements: “, count); for(i=0;i<count;i++) scanf(“%d”,&number[i]); // Logic of selection sort algorithm for(i=0;i<count;i++){ for(j=i+1;j<count;j++){ if(number[i]>number[j]){ temp=number[i]; number[i]=number[j]; number[j]=temp; } } } printf(“Sorted elements: “); for(i=0;i<count;i++) printf(” %d”,number[i]); return 0; }
#include<stdio.h> #include<string.h> int main(){ int i,j,count; char str[25][25],temp[25]; puts(“How many strings u are going to enter?: “); scanf(“%d”,&count); puts(“Enter Strings one by one: “); for(i=0;i<=count;i++) gets(str[i]); for(i=0;i<=count;i++) for(j=i+1;j<=count;j++){ if(strcmp(str[i],str[j])>0){ strcpy(temp,str[i]); strcpy(str[i],str[j]); strcpy(str[j],temp); } } printf(“Order of Sorted Strings:”); for(i=0;i<=count;i++) puts(str[i]); return 0; }