A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/db/d3c/tower__of__hanoi_8cpp_source.html below:

TheAlgorithms/C++: others/tower_of_hanoi.cpp Source File

Go to the documentation of this file. 20 const struct tower

*

const

U) {

21

std::cout <<

"\n\n\tF : "

;

22 for

(

int

i = 0; i < F->

top

; i++) {

23

std::cout << F->

values

[i] <<

"\t"

;

25

std::cout <<

"\n\tU : "

;

26 for

(

int

i = 0; i < U->

top

; i++) {

27

std::cout << U->

values

[i] <<

"\t"

;

29

std::cout <<

"\n\tT : "

;

30 for

(

int

i = 0; i < T->

top

; i++) {

31

std::cout << T->

values

[i] <<

"\t"

;

55 show

(From, To, Using);

57 TH

(n - 1, From, To, Using);

59 show

(From, To, Using);

60 TH

(n - 1, Using, From, To);

74

std::cout <<

"\nEnter number of discs : "

;

77 for

(

int

i = no; i > 0; i--) {

int values[10]

Values in the tower.

void show(const struct tower *const F, const struct tower *const T, const struct tower *const U)

void TH(int n, tower *From, tower *Using, tower *To)

void mov(tower *From, tower *To)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4