ACM (4) ASCII码排序

//http://acm.nyist.net/JudgeOnline/problem.php?pid=4

#include<stdio.h>
#include<stdlib.h>

//bubble sort
int main(){
	freopen("input.txt", "r", stdin);

	int N;
	scanf("%d", &N);
	for (int t = 0; t < N; t++){
		char s[3];
		char temp;
		scanf("%s", s);
		int flag = 1;
		for (int i = 0; i < 3&&flag == 1; i++){
			flag = 0;
			for (int j = 0; j < 2-i; j++){
				if (s[j]>s[j + 1]){
					temp = s[j];
					s[j] = s[j + 1];
					s[j + 1] = temp;
					flag = 1;
				}
			}
		}

		for (int i = 0; i < 3; i++){
			printf("%c ", s[i]);
		}
		printf("\n");
	}
}



/*
//Select Sort

int main(){
	//freopen("input.txt", "r", stdin);
	int N;
	scanf("%d", &N);

	while (N--){
		char s[3];
		scanf("%s", s);

		int k;
		char temp;
		for (int i = 0; i < 2; i++){
			k = i;
			for (int j = i + 1; j < 3; j++){
				if (s[j] < s[k]){
					k = j;
				}
			}
			if (i != k){
				temp = s[i];
				s[i] = s[k];
				s[k] = temp;
			}
		}

		for (int i = 0; i < 3; i++){
			printf("%c ", s[i]);
		}
		printf("\n");
	}
}
*/

/*
//insert sort

int main(){
	freopen("input.txt", "r", stdin);
	int N;
	scanf("%d", &N);
	while (N--){
		char s[3];
		int i, j;
		char temp;
		scanf("%s", s);
		for (j = 1; j < 3; j++){
			temp = s[j];
			i = j - 1;

			while (s[i]>temp){
				s[i + 1] = s[i];
				i--;
				if (i == -1){
					break;
				}
			}

			s[i + 1] = temp;
		}
		for (int k = 0; k < 3; k++){
			printf("%c ", s[k]);
		}
		printf("\n");
	}
	}*/