December 3, 20011 Algorithms and Data Structures Lecture XV Simonas Šaltenis Nykredit Center for Database Research Aalborg University [email protected].
P, NP and more. Goal: transfer all n disks from peg A to peg C Rules: –move one disk at a time –never place larger disk above smaller one Recursive solution:
