Documente Academic
Documente Profesional
Documente Cultură
Programmation avance
PROGRAMMATION AVANCEE
Prof. Karim Bana
ENSIAS
Programmation avance
Programmation avance
Plan de la leon
Tri par partition-fusion Tri rapide (quick sort) Tri par le tas (heap sort) Synthse
Programmation avance
Programmation avance
Programmation avance
7 2 9 4 2 4 7 9 7 2 99 44 2 4 7 9 7 29 4 2 4 7 9 2 4
3 8 6 1 1 3 8 6 3 8 6 1 1 3 6 8 3 8 6 1 1 3 8 6
72 2 7 7 22 2 7 722 7 7
9 4 4 9 9 4 4 9
3 8 3 8 3 8 3 8 3 8 3 8
6 1 1 6 6 1 1 6 6 1 1 6
77 77
22 22
99 99
44 44
33 33
88 88
66 66
11 11
Programmation avance
Programmation avance
Programmation avance
T(1) = O(1), T(n) = 2 * T(n/2) + O(n) T(n) = O(n log n) (thorme matre)
Prof. Karim Bana
ENSIAS
Programmation avance
Programmation avance
Programmation avance
(3) tri de I et S
Programmation avance
Programmation avance
Programmation avance
Programmation avance
22 44 33 11 1 2 4 7 7 2 9 4 2 3 9 2 4 7 4
7 9 7 1 3 78 96 71 17 37 89 6
21 21
9 4 4 9 4 3 3 4
88 3 3
9 88 9
99
44
Programmation avance
Programmation avance
Heap sort
Programmation avance
Programmation avance
13 73 29 41 30
73 41 29 13 30
13 73 41
Prof. Karim Bana
ENSIAS
73 29 41 13 30 29
30
Programmation avance
73 41 29 13 30
41 30 29 13
73 41 13
[0] [1] [2]
41 29 30 13
[0] [1] [2] [3]
29
[4]
30 [3]
[4]
73
41 73
Programmation avance
30 13 29
29 13
30 13
[0] [1] [2] [3]
29 29
[4] [0]
13
[1] [2] [3] [4]
29 30 41 73
Programmation avance
13
13
(4) table trie
[0] [1] [2] [3] [4]
Programmation avance
Programmation avance
Programmation avance
Synthse
Programmation avance
Programmation avance
Programmation avance
Supports utiliss
Programmation avance
Cours
P. Neophytou, Cours Heapsort , Pittsburgh University, USA, 2005 S. altenis, Cours Advanced Algorithms, Design and Analysis, Aalborg University, Denmark, 2003