 |
 |
|
2.3-3) Use mathematical induction to show that when n is an exact power of 2, the solution of the recurrence.
El caso base es cuando n = 2 entonces se tiene que n lg n = 2 lg 2= 2 * 1 = 2
|
 |
|
|
|
|
2.3-3) Use mathematical induction to show that when n is an exact power of 2, the solution of the recurrence.
El caso base es cuando n = 2 entonces se tiene que n lg n = 2 lg 2= 2 * 1 = 2
|
|
|
