Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
Mooophy committed Apr 5, 2015
1 parent 0d73ebd commit f277a66
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions ch02/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -220,9 +220,9 @@ Are-There-Two-Elements-That-Have-Sum-As-Specified(set, sum)
```cpp
As shown in Figure 2.5:
it takes theta(n) to merge each level in recursion tree. "
it takes theta(n) to merge each level in recursion tree.
total height of the recursion is theta(lg(n))
merging start from the first level to lg(k)
merging start from the first level to lg(k):
theta(n(lg(n) - lg(k))) = theta(n(lg(n/k)))
Hence, it takes T(n) = theta(n(lg(n/k))) to merge the sublists.
```

0 comments on commit f277a66

Please sign in to comment.