I want to know the best case complexity of Tower of Hanoi algorithm. The algorithm that I used is Algorithm
I have calculated the time complexity and it is T(2^n -1)
