How to sort multiple strings in C carriage returns between strings .

Just take a look at this one**.

Hope it helps.

Here are the specific steps:1Defines an array of five strings to store the strings that need to be sorted.

2.Use the string handler strcmp() to compare the size of the two strings. If string 1 is smaller than string 2, the return value is a negative integer; If string 1 is larger than string 2, the return value is a positive integer; If the two strings are equal, the return value is Establish a nested loop, compare the size between each of the two strings, and sort the strings from smallest to largest.

4.Outputs five sorted strings. Here's an example of an implementation:

c#include #include int main() printf("The sorted string is:");for (i = 0; i < 5; +i) puts(str[i]);Output five strings after the destruction of the pants lead sorted return 0; Note that the gets() and puts() functions are used when importing and outputting strings, respectively. This is because gets() can input strings that contain spaces, while puts() automatically adds a line break at the end of the output string.

Also pure picking, the string is larger when comparing using the strcmp() function.

Be careful to place it in an if statement to meet the requirement of sorting from smallest to largest in the order of English characters. Hope this answer is helpful to you. If you still have any questions or need further help, please feel free to continue to consult the cave.

You can beat the complete **.

Whole duck. You sort it out.

According to the requirements of the title, the C++ procedure for rent payment written by Cheating Mountain is as follows (see figure) <>

To give you an idea, you can achieve lowercase sorting, programming itself should not be difficult for your program to write directly in three parts, lowercase sorting, uppercase sorting, and number sorting. These three parts can be done in cycles.

This is done in lowercase sorting:

1.Make two pointers to find from front to back (don't want to use pointers, just use the shaping mark subscript) 2Find two lowercase letters in turn, if the first should be after the second, swap the positions of the two 3

The first pointer points to the position of the second, and the second continues to find the next lowercase letter, and repeats step 2 to the end of the end.

4.Write down the number of lowercase letters. Repeat 1-3 more times n-1 times.

In fact, it is to bubble up the lowercase letters, exclude the non-lowercase letters, and leave it untouched.

Uppercase and numeric can be done in cycles.

I won't write out the ** for the specific implementation, and ask if you don't understand.