ADA08(分治法-大整数、矩阵相乘).pptVIP

2009-2010-01 《Design and Analysis of Algorithm》 SCUEC 2007-2008-01《Design and Analysis of Algorithms》SCUEC * * * * * 2009-2010-01 《Design and Analysis of Algorithm》 SCUEC Review of last class The difference between quick sort and merge sort Divide step Combine step Stable or not In place or not Time efficiency The basic idea of quick sort algorithm Divide and Conquer (III) Chapter 4 Application to numerical problem Large integers multiplication Matrices multiplication Application to combinatorial problem Triomino puzzle * * 2009-2010-01 《Design and Analysis of Algorithm》