add "upload your work" section to README

README.md

@@ -10,6 +10,7 @@ Finally, a few examples of trees will be showcased:
 - neighborhood optimization in $n$-body systems
 
 # Table of content
+- [_Upload your work to the LMS_](#upload-your-work-to-the-lms-toc)
 - [_Binary search_](#binary-search-toc)
   - [_Question 1._](#question-1-toc)
   - [_Question 2._](#question-2-toc)
@@ -86,6 +87,19 @@ Finally, a few examples of trees will be showcased:
 
 ![trees](assets/trees.png)
 
+---
+
+## Upload your work to the LMS [[toc](#table-of-content)]
+- open a terminal
+- go into the folder containing your project
+- use the `zip` command to compress your project
+```shell
+zip -r project.zip . -x "venv/**" ".git/**"
+```
+- upload the ZIP archive to the [LMS](https://lms.isae.fr/mod/assign/view.php?id=116610&action=editsubmission)
+
+---
+
 ## Binary search [[toc](#table-of-content)]
 Let's start this class with a quite simple problem: given a list $l$ of $n$
 integers and an integer $i$, how can you tell whether or not $i$ is $l$?