Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Tower Of Hanoi
// C++ recursive function to // solve tower of hanoi puzzle #include <bits/stdc++.h> using namespace std; void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) { if (n == 1) { cout << "Move disk 1 from rod " << from_rod << " to rod " << to_rod<<endl; return; } towerOfHanoi(n - 1, from_rod, aux_rod, to_rod); cout << "Move disk " << n << " from rod " << from_rod << " to rod " << to_rod << endl; towerOfHanoi(n - 1, aux_rod, to_rod, from_rod); } // Driver code int main() { int n = 5; // Number of disks towerOfHanoi(n, 'A', 'C', 'B'); // A, B and C are names of rods return 0; } // This is code is contributed by rathbhupendra
run
|
edit
|
history
|
help
0
Policy based smart pointer
data locality - fast example
CqueueArray
Exempel 2
C++
find-missing-number-arithmetic-progression
156
Counting top students
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
GET ALL PRIME FACTORS OF A NUMBER