共 2 篇文章 |
|
ri++){ if(tpRed[ri]>tpRed[ri+1]){ int Red_Temp = tpRed[ri];ri++){ if(tpGreen[ri]>tpGreen[ri+1]){ int Green_Temp = tpGreen[ri];ri++){ if(tpBlue[ri]>tpBlue[ri+1]){ int Blue_Temp = tpBlue[ri]; 阅18881 转121 评0 公众公开 13-01-24 16:57 |
算法详解--汉诺塔From Gossip@caterpillarAlgorithm Gossip: 汉诺塔算法详解 说明河内之塔(Towers of Hanoi)是法国人M.Claus(Lucas)于1883年从泰国带至法国的,河内为越战时北越的首都,即现在的胡志明市;void hanoi(int n, char A, char B, char C) { if(n == 1) { printf("Move sheet %d from %c to %c\n", n, A, C);Hanoi hanoi ... 阅13292 转81 评0 公众公开 13-01-21 20:32 |