MCPcopy Create free account
hub / github.com/TheAlgorithms/C-Plus-Plus / TH

Function TH

others/tower_of_hanoi.cpp:52–62  ·  view source on GitHub ↗

* Recursive algorithm to solve the puzzle * \param [in] n starting number of disks * \param [in,out] From tower to move disks from * \param [in,out] Using temporary tower for the puzzle * \param [in,out] To tower to move disk to */

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers 1

mainFunction · 0.85

Calls 2

movFunction · 0.85
showFunction · 0.70

Tested by

no test coverage detected