Hi, I'm Franklin Qin.
In this blog I talk about how this blog was built, developed, and transformed to the current state.
Recently, I created the algo site
Nobody knows more about course scheduling algorithm than I do.
A few weeks ago, I was invited to a friend's house. On the table I saw the Tower of Hanoi game. I immediately realized with intuition that the total number of steps to move should be exponential to the number of disks, but I could not think of a proof at the time. Thus, I write this blog to explain this interesting ancient problem.
Studiennotizen zum Deutschlernen.