# IT, Computer Science/Algorithm 썸네일형 리스트형 Master theorem (마스터 이론) Divide and conquer algorithm에서 time complexity를 구할 수 있는 공식 -> 두 식 모두 표현 가능함. n is the size of the problem.a is the number of subproblems in the recursion.n/b is the size of each subproblem. (Here it is assumed that all subproblems are essentially the same size.)f (n) is the cost of the work done outside the recursive calls, which includes the cost of dividing the problem and the cost of merging .. 더보기 이전 1 2 3 4 ··· 6 다음
