摘要：
#includevoid Sort(int *header,int length){ if(length > 0) { int i = 0; int temp = 0; for(i = 1; i = *header) { temp = *header; *header = *(header + i); *(header + i) = temp; } } Sort(header + 1,length - 1); } else { return; }}int main(){ int in_str[8] = {12, 13, 7, 9, 11, 37, 45, ... 阅读全文
