MO417 A	Complexidade de Algoritmos I	João Meidanis	1o.sem/2013
		Texto:	Introduction to Algorithms	Cormen et al.	3a.ed., 2009
Aula	S/Q	Data	Atividade	MIT Vídeo	Observações
	Mon	25/02/2013
1	Wed	27/02/2013	Apresentação
2	Mon	04/03/2013	Getting started	Lecture 1
3	Wed	06/03/2013	Growth of functions
4	Mon	11/03/2013	Recurrences	Lecture 2
5	Wed	13/03/2013	Heapsort
6	Mon	18/03/2013	Quicksort	Lecture 4
7	Wed	20/03/2013	Sorting in linear time	Lecture 5
8	Mon	25/03/2013	Medians and order statistics	Lecture 6
9	Wed	27/03/2013	Prova I1
10	Mon	01/04/2013	Dynamic programming	Lecture 15
11	Wed	03/04/2013	Dynamic programming
12	Mon	08/04/2013	Greedy algorithms	Lecture 16
13	Wed	10/04/2013	Greedy algorithms
14	Mon	15/04/2013	Search trees	Lecture 10
15	Wed	17/04/2013	Red-black trees
16	Mon	22/04/2013	Prova G1
17	Wed	24/04/2013	Disjoint sets
18	Mon	29/04/2013	Graph algorithms			Desist.
	Wed	01/05/2013	Não haverá atividades
19	Mon	06/05/2013	Graph algorithms
20	Wed	08/05/2013	Minimum spanning tree
21	Mon	13/05/2013	Single-source shortest paths	Lecture 17
22	Wed	15/05/2013	Single-source shortest paths	Lecture 18
23	Mon	20/05/2013	Prova I2			Tranc.
24	Wed	22/05/2013	All-pairs shortest paths	Lecture 19
25	Mon	27/05/2013	Maximum flow
26	Wed	29/05/2013	Maximum flow
27	Mon	03/06/2013	NP-completeness Sec. 34.1
28	Wed	05/06/2013	NP-completeness Sec. 34.2 e 34.3
29	Mon	10/06/2013	NP-completeness Sec. 34.3
30	Wed	12/06/2013	NP-completeness Sec. 34.4 e 34.5
31	Mon	17/06/2013	Prova G2
32	Wed	19/06/2013