/* Sort array of 10 strings. */
#include<string.h>
#include<stdio.h>
int main()
{
int i,j;
char str[10][10],temp[10];
printf("Type 10 names :\n");
for(i=0;i<10;i++)
{
// gets(str[i]);
// fgets is a better option over gets to read multiword string .
fgets(str[i], 10, stdin);
}
for(i=0;i<10;i++)
{
for(j=0;j<10-1-i;j++)
{
if(strcmpi(str[j],str[j+1])>0)
{
strcpy(temp,str[j]);
strcpy(str[j],str[j+1]);
strcpy(str[j+1],temp);
}
}
}
printf("\nSorted Names :\n");
for(i=0;i<10;i++)
puts(str[i]);
return 0;
}
A Tech publication for all. Get Knowledge about Web Development, Programming, and trending news, tutorials, and tools for beginners to experts.
Friday, September 23, 2016
Sort array of 10 strings
Subscribe to:
Post Comments (Atom)
-
1 23 456 78910 #include<stdio.h> int main() { int i,j,k; k=1; for(i=1;i<5;i++) { for(j=1;j<=i;j++) { printf("%d",k++);...
-
🌍 World Geo Data — Full Country, State, City & Currency Dataset This repository provides an overview of the World Geo Data digital pro...
-
Complete beginner-friendly guide to generate and install a free SSL certificate on Windows server If you’re running a website on Windows Se...
-
Learn how to configure Let’s Encrypt SSL on Windows 11 using Win-ACME and IIS. Securing your website with HTTPS is no longer optional—it’s a...
-
In my 20's I would ask mentors what they thought the most important key to success was. They all had different opinions. Then one gave m...
-
1 3 8 15 27 50 92 169 311 void main() { int a=1, b=3, c=4, n=10, sum, i; printf("%d %d ",a,b,c); for(i=4; i<=n; i++...
-
/* Transpose the matrix */ #include<stdio.h> int main() { int a[4][4],i,j,b; for(i=0;i<4;i++) { printf("\nEnter elements of %d...
-
1 10 101 1010 10101 #include<stdio.h> int main() { int i,j,k; for(i=1;i<=5;i++) { for(j=1;j<=i;j++) { printf("%d",j%2)...
-
1 123 12345 1234567 #include<stdio.h> void main() { int i,j; for(i=1;i<=7;i+=2) { for(j=1;j<=i;j++) { printf...
-
/* Sort array of 10 strings. */ #include<string.h> #include<stdio.h> int main() { int i,j; char str[10][10],temp[10]; printf(...
No comments:
Post a Comment