代码

# include <cstddef>
void sort(unsigned *a, int n) {
	for (int i = n - 1; i > 0; i--) {
        for (size_t j = 0; j < i; j++) {
            if (a[j] > a[j + 1]) {
            	unsigned u = a[j], v = a[j + 1];
//            	a[j] = v;
            	a[j + 1] = u;
            	asm (
            		""
//					"mov 0(%0,%1,4), %2 \n"
//					"mov 4(%0,%1,4), %3 \n"
					"mov %3, 0(%0,%1,4) \n"
//					"mov %2, 4(%0,%1,4) \n"
					: : "r"(a), "r"(j), "r"(u), "r"(v));
            }
        }
    }
}

评测结果