2026_TD2_DEV51_Qualite_Algo/COMPTE_RENDU.md

Groupe : 
- FRAMERY Karl
- ABRAHAM Ozvann


1. Dessiner le graphe


### C2
![C2](./C2.png)

### C4
![C4](./C4.png)

### P2
![P2](./P2.png)

### P3
![P3](./P3.png)

### J2
![J2](./J2.png)

### J6
![J6](./J6.png)


2. Compter les décisions


3. Classer



- [ ] C1 -> <span style="color:blue"> simple </span>
- [ ] C2 -> <span style="color:blue"> simple </span>
- [ ] C3 -> <span style="color:blue"> simple </span>
- [ ] C4 -> <span style="color:yellow"> moyen </span>
- [ ] C5 -> <span style="color:yellow"> moyen </span>
- [ ] C6 -> <span style="color:red"> complexe </span>

- [ ] J1 -> <span style="color:blue"> simple </span>
- [ ] J2 -> <span style="color:blue"> simple </span>
- [ ] J3 -> <span style="color:red"> complexe </span>
- [ ] J4 -> <span style="color:red"> complexe </span>
- [ ] J5 -> <span style="color:red"> complexe </span>
- [ ] J6 -> <span style="color:red"> complexe </span>

- [ ] P1 -> <span style="color:blue"> simple </span>
- [ ] P2 -> <span style="color:blue"> simple </span>
- [ ] P3 -> <span style="color:yellow"> moyen </span>
- [ ] P4 -> <span style="color:yellow"> moyen </span>
- [ ] P5 -> <span style="color:red"> complexe </span>



4. Justifier les cas particuliers

5. Refactoriser