c++
关注
分享
扫一扫
TRAMP_ZZY
不随黄叶舞秋风
展开
-
排序算法 C++
#include #include using namespace std;#define MAXSIZE 30typedef struct { int key; string name;}RedType;typedef struct SqList { RedType r [MAXSIZE+1]; int length;}SqList;/原创 2012-09-16 16:41:08 · 722 阅读 · 0 评论 -
C++汉诺塔
int c = 0;void move(char x, int n, char z) {cout}void Hanoi(int n, char A, char B, char C) {//当n=1时，直接移动到Cif (n == 1) {move(A, 1, C);} else {//将前n-1个，从A通过C，移动到BHanoi(n-1, A, C, B);原创 2012-09-15 20:38:35 · 1400 阅读 · 0 评论 -
汉诺塔C++
[size=xx-small]int c = 0;void move(char x, int n, char z) { cout原创 2012-09-15 20:46:42 · 133 阅读 · 0 评论 -
排序算法C++
#include #include using namespace std;#define MAXSIZE 30typedef struct { int key; string name;}RedType;typedef struct SqList { RedType r [MAXSIZE+1]; int length;}SqList;/...原创 2012-09-16 16:49:19 · 110 阅读 · 0 评论