摘要：
//前序遍历 #include #define SIZE 8 char Tree[SIZE] = {0, 'A' ,'B','C','D','E','F','G'}; void preOrder(int root) { if(root * 2 >= SIZE) { printf("%c",Tree[root]); return; } ... 阅读全文
摘要：
//AToI #include #define SIZE 200 int data[SIZE] = {4,5,6,7}; int AToI(int N,int Base) { int ret = 0; for(int i=0;i #define SIZE 20 int data[SIZE]; int IToA(int num,int Base,int Len) { ... 阅读全文
摘要：
/////////selectSort //cases: //5 //20 //1 45 14 23 45 15 15 13 456 1 4165 456 123 436 13 6 456 651 65 6 //10 //1 5 8 9 6 4 5 3 8 6 //30 //1 4 2 7 1 7 8 9 2 4 1 4 2 7 1 7 8 9 2 4 1 2 3 7 4 8 5 9 4 2 ... 阅读全文