advancedcountingtechniques.pptVIP

College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan Yang Juan jyang@tseg.org College of Computer Science Technology Beijing University of Posts Telecommunications * College of Computer Science Technology, BUPT -- ? Copyright 2001~2003 Yang Juan §7.3: Divide Conquer R.R.s Main points so far: Many types of problems are solvable by reducing a problem of size n into some number a of independent subproblems, each of size ??n/b?, where a?1 and b1. The time complexity to solve such problems is given by a recurrence relation: T(n) = a·T(?n/b?) + g(n) Time to break