PROGRAMMING:Symmetric Order

In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished
writing a program whose output is a list of names in nondescending order by length (so that each name is at
least as long as the one preceding it). However, your boss does not like the way the output looks, and instead
wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer
strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first
name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first
pair, Jean and Kevin the second pair, etc.
### Input###
The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set
starts with a line containing an integer, n, which is the number of strings in the set, followed by n strings, one
per line, sorted in nondescending order by length. None of the strings contain spaces. There is at least one and
no more than 15 strings per set. Each string is at most 25 characters long.
### Output
For each input set print "SET n" on a line, where n starts at 1, followed by the output set as shown in the
sample output.
### Sample Input:
```in
seven
Bo
Pat
Jean
Kevin
Claude
William
Marybeth
six
Jim
Ben
Zoe
Joey
Frederick
Annabelle
five
John
Bill
Fran
Stan
Cece
0
```
### Sample Ouput:
```out
SET 1
Bo
Jean
Claude
Marybeth
William
Kevin
Pat
SET 2
Jim
Zoe
Frederick
Annabelle
Joey
Ben
SET 3
John
Fran
Cece
Stan
Bill
```







answer：If there is no answer, please comment
The list of names in non decreasing order of length is s [1]... S [n].
Requires that the output format is symmetric, the shortest string in the
Top and bottom, longest in middle; In other words, in the
In the upper half of the output, the length of the name is increasing; And in
In the lower half of the output, the length of the name is decreasing. This topic
There are two solutions: non recursive and recursive.
Non recursive method
The strings in the set of input strings are arranged in non decreasing order of length. The output is symmetric, with the shortest string at the top
Therefore, the output of the upper half is as follows:
• s[1]
• s[3]
• s[5]
• ……
· s [n], if n is odd; Or s [n-1], if n is even.
In other words, the loop statement "for (int i = 1; i<=n; i+=2) cout<The output of the lower half is as follows:
• s[n-(n%2)]
• s[n-(n%2)-2]
• s[n-(n%2)-4]
• ……
• s[2]
In other words, the loop statement "for (int i = n - (n% 2)); i>1; i-=2) cout<