problem
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!

Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.

Output
For each case, print the sorting result, and one line one case.

Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9

Sample Output
1 2 3
1 2 3 4 5 6 7 8 9

为什么你要打英文
》？

因为那题本身就是这样的，人家直接复制粘贴的

我去

用快速排序

先翻译成中文吧，看不懂

#include <stdio.h>
#include <stdlib.h>
#define N 1000u

int compare(const void *p1, const void *p2)
{
   return *(int *)p1 - *(int *)p2;
}

int contains(int *buffer, int value, int bufferSize)
{
   int i;

   for (i = 0; i < bufferSize; ++i)
      if (buffer[i] == value)
         return 1;
   return 0;
}

int main(void)
{
   int T, integers[N], i = 0, j, k, ch, temp;

   scanf("%d", &T);
   getchar();  // Skip the '\n'
   while (i++ < T) {
      // If the character ch is not '\n' then put it back in stdin, else break.
      for (j = 0; (ch = getchar()) != '\n' ? ungetc(ch, stdin) : 0;) {
         scanf("%d", &temp);
         // If integers not contains the next input then adding to the integers.
         if (!contains(integers, temp, j))
            integers[j++] = temp;
      }
      qsort(integers, j, sizeof(int), compare);
      for (k = 0; k < j; ++k)
         printf("%d ", integers[k]);
      printf("\n");
   }
}

[ 本帖最后由 lz1091914999 于 2011-11-27 13:15 编辑 ]