GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — JavaScriptTheAlgorithms/Recursive/TowerOfHanoi.js at master · apetcho/JavaScriptTheAlgorithms Expand file tree/ Copy pathTowerOfHanoi.jsMore file actions 18 lines (15 loc) · 542 Bytes / Copy pathTowerOfHanoi.jsFile metadata and controls18 lines (15 loc) · 542 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 // wiki - https://en.wikipedia.org/wiki/Tower_of_Hanoi // Recursive Javascript function to solve tower of hanoi export function TowerOfHanoi(n, from, to, aux, output = []) { if (n === 1) { output.push(`Move disk 1 from rod ${from} to rod ${to}`) return output } TowerOfHanoi(n - 1, from, aux, to, output) output.push(`Move disk ${n} from rod ${from} to rod ${to}`) TowerOfHanoi(n - 1, aux, to, from, output) return output } // Driver code (A, C, B are the name of rods) // const n = 4 // TowerOfHanoi(n, 'A', 'C', 'B') |
| You are visitor 01402520 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |