Compare revisions

630f0a6b · 4a0ca28b · 4a0ca28b · 4a0ca28b · 630f0a6b · 630f0a6b
--- a/TD07bis/monnaie-progdyn.png
+++ b/TD07bis/monnaie-progdyn.png
--- a/TDO4/code/load.py
+++ b/TDO4/code/load.py
-labyrinthe = [[0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 1, 0, 0, 0, 0, 0],
-              [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]]
-
-def affiche_labyrinthe(l):
-    print('\n'.join([''.join(['{:4}'.format(item) for item in row]) 
-        for row in l]))
\ No newline at end of file
--- a/TDO4/code/priorite.py
+++ b/TDO4/code/priorite.py
-from queue import PriorityQueue
-
-file_prio = PriorityQueue()
-file_prio.put((2, "Bob"))
-file_prio.put((1, "Alice"))
-
-while not file_prio.empty():
-     print(file_prio.get())
\ No newline at end of file
--- a/TDO4/td4.pdf
+++ b/TDO4/td4.pdf
--- a/aide-info.pdf
+++ b/aide-info.pdf
--- a/books/Dsa.pdf
+++ b/books/Dsa.pdf
--- a/books/Python_Algorithms_Data_Structures.pdf
+++ b/books/Python_Algorithms_Data_Structures.pdf
--- a/books/ods-python.pdf
+++ b/books/ods-python.pdf
--- a/books/problemsolving.pdf
+++ b/books/problemsolving.pdf
--- a/books/pythonlearn.pdf
+++ b/books/pythonlearn.pdf
--- a/books/thinkpython2.pdf
+++ b/books/thinkpython2.pdf
--- a/cours-exercices/01-data-structures-complexity-exercises.ipynb
+++ b/cours-exercices/01-data-structures-complexity-exercises.ipynb
--- a/cours-exercices/02-recursion-exercises.ipynb
+++ b/cours-exercices/02-recursion-exercises.ipynb
--- a/cours-exercices/03-lists-search-sort-exercises.ipynb
+++ b/cours-exercices/03-lists-search-sort-exercises.ipynb
--- a/cours-exercices/04-stacks-queues-exercises.ipynb
+++ b/cours-exercices/04-stacks-queues-exercises.ipynb
--- a/cours/01-data-structures-complexity.pdf
+++ b/cours/01-data-structures-complexity.pdf
--- a/cours/02-recursion.pdf
+++ b/cours/02-recursion.pdf
--- a/cours/03-lists-search-sort.pdf
+++ b/cours/03-lists-search-sort.pdf
--- a/cours/04-stacks-queues.pdf
+++ b/cours/04-stacks-queues.pdf
--- a/cours/05-programming-strategies.pdf
+++ b/cours/05-programming-strategies.pdf
No results found