Register
Dark Mode

tower of hanoi DOUBT

in DS
216 views
1 vote
1 vote

in tower ,smallest disk req, 2n-1 moves 

right ?

in DS
by
216 views

1 comment

by
It requires $2^{n-1} but not 2^{n}-1$.

For instance n=3 smallest one requires only 4 moves.
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
Ankit Garg 2 asked in DS Nov 26, 2018
353 views
Tower of Hanoi Please explain this question
Ankit Garg 2 asked in DS Nov 26, 2018
by Ankit Garg 2
353 views
2 votes
2 votes
1 answer
2
Naveen Kumar 3 asked in DS Jul 18, 2018
1,224 views
Tower Of Hanoi Problem
a) Wednesday b)Tuesday c)Thursday d)Friday e)None of the above
Naveen Kumar 3 asked in DS Jul 18, 2018
by Naveen Kumar 3
1.2k views

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!