数组排序.txt

来自「一种CMM语言的词法分析」· 文本 代码 · 共 20 行

int length;
read length;
int x[length];
read x;
write x;
int i = 1;
while (i<length) {
	int j = 0;
	while (j < length-i) {
		int k = j+1;
		if (x[j]>x[k]) {
			int a = x[j];
			x[j] = x[k];
			x[k] = a;
		}
		j = j+1;
	}	
	i = i+1;
}
write x;