Lecture 1:a. Correctnes b. Applets c. Tables Lecture 2 a.Applets b.Tables c.Exercises Lecture 3Lecture 4a. Appletsb. ProblemsLecture 5 Lecture 6 Lecture 7 Lecture 8 Test 1 Test 2
exercise 7-25
___1. Case 1
entonces se tiene que el tiempo de ejecucion esta dado por:
t(n) = O(2n) +1
___2. Case 2
t(n) = O(3n) +1
Algorithms | Blackboard | UNAL | SIA |Bibliotecas|UNALdotNET
©2006 [email protected] [email protected]