hanoi tower
DESCRIPTION
Algoritma Hanoi TowerTRANSCRIPT
![Page 1: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/1.jpg)
Stack
![Page 2: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/2.jpg)
2
1
![Page 3: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/3.jpg)
2 1
![Page 4: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/4.jpg)
21
![Page 5: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/5.jpg)
2
1
![Page 6: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/6.jpg)
3
1
2
![Page 7: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/7.jpg)
3
2
1
![Page 8: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/8.jpg)
3 2 1
![Page 9: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/9.jpg)
3 2
1
![Page 10: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/10.jpg)
32
1
![Page 11: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/11.jpg)
321
![Page 12: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/12.jpg)
3
2
1
![Page 13: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/13.jpg)
3
2
1
![Page 14: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/14.jpg)
1
Pindahkan data n-1 dari A ke B , Gunakan C sebagai stack bantu.
Source untuk data n-1 = A, Destination = B
2
Pindahkan data ke n dari A ke C, gunakan B sebagai Stack bantu
Source : A , Destination C
3
Pindahkan data ke n-1 dari B ke C, gunakan A sebagai stack bantu
Source B , Destination C
3
1
2
A B C
![Page 15: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/15.jpg)
3
1
2
A B C
Source Intermediate Destination
![Page 16: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/16.jpg)
Step 1 : Pindahkan data n-1 dari source (a) ke destination (intermediate)
3
1
2
A B C
Source Intermediate Destination
![Page 17: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/17.jpg)
Bagaimana memindahkan 2 dan 1 dari A kestack B?
3
1
2
A B CSource Intermediate Destination
![Page 18: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/18.jpg)
Gunakan lagi algoritma hanoi.. Step 1 : pindahkan n-1 dari source ke intermediate.. N saat ini = 2
1
2
A B C
Source Destination Intermediate
![Page 19: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/19.jpg)
Step 1 : pindahkan n-1 dari source ke intermediate
1
2
A B C
Source Destination Intermediate
![Page 20: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/20.jpg)
Gunakan lagi algoritma hanoi.. Step 2 : pindahkan n dari source ke destination
12
A B C
Source Destination Intermediate
![Page 21: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/21.jpg)
Step 3 : pindahkan n-1 dari intermediate ke Destination
1
2
A B C
Source Destination Intermediate
![Page 22: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/22.jpg)
Maka, kita dapatkan 1 dan 2 di B.
3
1
2
A B C
Source Intermediate Destination
![Page 23: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/23.jpg)
Step 2 , pindahkan data n dari source(a) ke destination (c)
3
1
2
A B C
Source Intermediate Destination
![Page 24: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/24.jpg)
Step 3 pindahkan n-1 dari B ke C.
3
1
2
A B C
Source Intermediate Destination
![Page 25: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/25.jpg)
Step 3 Bagaimana untuk memindahkan 1, 2 dari B ke C?
3
1
2
A B C
Source Intermediate Destination
![Page 26: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/26.jpg)
Gunakan lagi algoritma hanoi.. Step 1 : pindahkan n-1 dari source(b) ke Destination(c)
3
1
2
A B C
Intermediate Source Destination
![Page 27: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/27.jpg)
Step 1 : pindahkan n-1 dari source(b) ke Destination(c)
31 2
A B C
Intermediate Source Destination
![Page 28: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/28.jpg)
Step 2 : Pindahkan data n dari source(b) ke destination(c)
31
2
A B C
Intermediate Source Destination
![Page 29: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/29.jpg)
Step 3 : Pindahkan data n-1 dari intermediate(a) ke destination(c)
3
1
2
A B C
Intermediate Source Destination
![Page 30: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/30.jpg)
3
1
2
A B C
![Page 31: Hanoi tower](https://reader034.vdocuments.mx/reader034/viewer/2022052307/559c52151a28abe2458b4888/html5/thumbnails/31.jpg)
Amalia Nuryamin