From 206600e7207e1453bf353e5b947e854948b68f3c Mon Sep 17 00:00:00 2001
From: Syauqi_AlifIhsan <syauqi.alif-ihsan9@etu.univ-lorraine.fr>
Date: Wed, 19 Mar 2025 10:48:52 +0100
Subject: [PATCH] readme pour le Quicksort
---
.../{Main and rank 3 => include}/rank (3).h | 0
.../Projet_Canevas/canevas => src}/io.c | 33 ++--
.../Projet_Canevas/canevas => src}/job.c | 0
LES TA DES TACHES/src/job_2.c | 14 +-
LES TA DES TACHES/src/list_2.c | 10 +-
.../{Main and rank 3 => src}/main (1).c | 0
README.md | 162 +++++++++++-------
7 files changed, 137 insertions(+), 82 deletions(-)
rename LES TA DES TACHES/{Main and rank 3 => include}/rank (3).h (100%)
rename LES TA DES TACHES/{READGRAPH ET QUICKSORT/Projet_Canevas/canevas => src}/io.c (82%)
rename LES TA DES TACHES/{READGRAPH ET QUICKSORT/Projet_Canevas/canevas => src}/job.c (100%)
rename LES TA DES TACHES/{Main and rank 3 => src}/main (1).c (100%)
diff --git a/LES TA DES TACHES/Main and rank 3/rank (3).h b/LES TA DES TACHES/include/rank (3).h
similarity index 100%
rename from LES TA DES TACHES/Main and rank 3/rank (3).h
rename to LES TA DES TACHES/include/rank (3).h
diff --git a/LES TA DES TACHES/READGRAPH ET QUICKSORT/Projet_Canevas/canevas/io.c b/LES TA DES TACHES/src/io.c
similarity index 82%
rename from LES TA DES TACHES/READGRAPH ET QUICKSORT/Projet_Canevas/canevas/io.c
rename to LES TA DES TACHES/src/io.c
index 10cbc76..45705dc 100644
--- a/LES TA DES TACHES/READGRAPH ET QUICKSORT/Projet_Canevas/canevas/io.c
+++ b/LES TA DES TACHES/src/io.c
@@ -71,21 +71,28 @@ list_t * read_graph ( char * filename ) {
return G;
}
-void quick_sort(list_t * L, int (*cmpFct)()){
+void quick_sort(list_t * L, int (*cmpFct)(void*, void*)) {
assert(L && cmpFct);
- if(L->numelm > 1){
+ if (L->numelm > 1) {
+
elmlist_t * pivot = get_head(L);
- L->head = get_suc(pivot); // reste(L)
+ L->head = get_suc(pivot);
pivot->pred = NULL;
pivot->suc = NULL;
+
+ /** @note
+ * La listes des données inférieures à pivot
+ * La listes des données supérieures à pivot
+ */
list_t * val_inf_pivot = new_list();
list_t * val_sup_pivot = new_list();
+ /** @note Déplacement des données de L dans val_inf_pivot et val_sup_pivot */
partition(L,pivot,val_inf_pivot,val_sup_pivot,cmpFct);
- /// On supprimer les éléments de L sans supprimer ni L ni les jobs
+ /** @note On supprimer les éléments de L sans supprimer ni L ni les jobs */
elmlist_t * S;
for(elmlist_t * E = L->head; E; E = S){
S = E->suc;
@@ -96,26 +103,28 @@ void quick_sort(list_t * L, int (*cmpFct)()){
* Si la partie inf est vide alors L commence par le pivot
* Sinon on tri grâce à cmpFct la partie inf puis on ajoute en queue le pivot
*/
- if(is_empty(val_inf_pivot)){
+
+
+ if (is_empty(val_inf_pivot)) {
L->head = pivot;
L->tail = pivot;
L->numelm = 1;
- }else{
- quick_sort(val_inf_pivot,cmpFct);
+ } else {
+ quick_sort(val_inf_pivot, cmpFct);
L->head = val_inf_pivot->head;
L->tail = val_inf_pivot->tail;
L->numelm = val_inf_pivot->numelm;
- pivot->pred= L->tail;
+ pivot->pred = L->tail;
L->tail->suc = pivot;
L->tail = pivot;
L->numelm += 1;
}
- /** @note
+ /** @note
* Si la partie sup n'est pas vide alors
* On la trie puis on la concatène à la partie inf
*/
- if(!is_empty(val_sup_pivot)){
- quick_sort(val_sup_pivot,cmpFct);
+ if (!is_empty(val_sup_pivot)) {
+ quick_sort(val_sup_pivot, cmpFct);
val_sup_pivot->head->pred = pivot;
set_suc(pivot, val_sup_pivot->head);
L->tail = val_sup_pivot->tail;
@@ -124,4 +133,4 @@ void quick_sort(list_t * L, int (*cmpFct)()){
free(val_inf_pivot);
free(val_sup_pivot);
}
-}
+}
\ No newline at end of file
diff --git a/LES TA DES TACHES/READGRAPH ET QUICKSORT/Projet_Canevas/canevas/job.c b/LES TA DES TACHES/src/job.c
similarity index 100%
rename from LES TA DES TACHES/READGRAPH ET QUICKSORT/Projet_Canevas/canevas/job.c
rename to LES TA DES TACHES/src/job.c
diff --git a/LES TA DES TACHES/src/job_2.c b/LES TA DES TACHES/src/job_2.c
index 6f90c4d..e64e9ad 100644
--- a/LES TA DES TACHES/src/job_2.c
+++ b/LES TA DES TACHES/src/job_2.c
@@ -62,7 +62,7 @@ char * get_job_tilte(job_t * J) {
return J->title;
}
-// Sets the title of the job, freeing the old title if needed.
+
void set_job_title(job_t * J, char * title) {
assert(J && title);
if(J->title)
@@ -70,37 +70,37 @@ void set_job_title(job_t * J, char * title) {
J->title = strdup(title);
}
-// Returns the life (duration) of the job.
+
double get_job_life(job_t * J) {
assert(J);
return J->life;
}
-// Sets the life (duration) of the job.
+
void set_job_life(job_t * J, double life) {
assert(J);
J->life = life;
}
-// Returns the input degree (number of precedents) of the job.
+
int get_job_iDegree(job_t * J) {
assert(J);
return J->input_degree;
}
-// Sets the input degree of the job.
+
void set_job_iDegree(job_t * J, int iDegree) {
assert(J);
J->input_degree = iDegree;
}
-// Increments the input degree of the job.
+
void incr_job_iDegree(job_t * J) {
assert(J);
J->input_degree++;
}
-// Decrements the input degree of the job.
+
void decr_job_iDegree(job_t * J) {
assert(J);
J->input_degree--;
diff --git a/LES TA DES TACHES/src/list_2.c b/LES TA DES TACHES/src/list_2.c
index d2cd4a5..ed867d3 100644
--- a/LES TA DES TACHES/src/list_2.c
+++ b/LES TA DES TACHES/src/list_2.c
@@ -110,11 +110,11 @@ void quick_sort(list_t * L, int (*cmpFct)(void*, void*)) {
partition(L,pivot,val_inf_pivot,val_sup_pivot,cmpFct);
/** @note On supprimer les éléments de L sans supprimer ni L ni les jobs */
- elmlist_t * S;
- for(elmlist_t * E = L->head; E; E = S){
- S = E->suc;
- free(E);
- }
+ // elmlist_t * S;
+ // for(elmlist_t * E = L->head; E; E = S){
+ // S = E->suc;
+ // free(E);
+ // }
/** @note
* Si la partie inf est vide alors L commence par le pivot
diff --git a/LES TA DES TACHES/Main and rank 3/main (1).c b/LES TA DES TACHES/src/main (1).c
similarity index 100%
rename from LES TA DES TACHES/Main and rank 3/main (1).c
rename to LES TA DES TACHES/src/main (1).c
diff --git a/README.md b/README.md
index 52e313b..2f74ab2 100644
--- a/README.md
+++ b/README.md
@@ -1,93 +1,139 @@
# Projet_Pne
+# METHODE DE QUICKSORT
+
+
+
+# FONCTION PARTITION
+
+static void partition(list_t * L, elmlist_t * pivot, list_t * val_inf, list_t * val_sup, int (*cmpFct)(void*, void*)) {
+ for (elmlist_t * cur = L->head; cur != NULL; cur = cur->suc) { //on parcourt la liste de la tête jusqu'à 0
+ if (cmpFct(get_data(cur), get_data(pivot)) < 0) //cmpfct va decider si le data est inferiur
+ queue(val_inf, get_data(cur));
+ else
+ queue(val_sup, get_data(cur));
+ }
+}
+
+
+# FONCTION QUICKSORT
+
+# Etape (1)
+void quick_sort(list_t * L, int (*cmpFct)(void*, void*)) {
+ assert(L && cmpFct); //on verifier L et CmpFct
+
+ if (L->numelm > 1) {
+
+ elmlist_t * pivot = get_head(L); //la tete sera un pivot et on le retire de la liste
+ L->head = get_suc(pivot);
+ pivot->pred = NULL;
+ pivot->suc = NULL;
+ }
+
+# Etape (2)
+//on créer deux nouveaux liste
+list_t * val_inf_pivot = new_list();
+list_t * val_sup_pivot = new_list();
+
+
+# Etape (3)
+
+//on appelle le fonction partition
+partition(L,pivot,val_inf_pivot,val_sup_pivot,cmpFct);
+
+# Etape (4)
+
+ if (is_empty(val_inf_pivot)) { //le liste sera le pivot s'il n'y en a pas
+ L->head = pivot;
+ L->tail = pivot;
+ L->numelm = 1;
+ } else {
+ quick_sort(val_inf_pivot, cmpFct);
+ L->head = val_inf_pivot->head;
+ L->tail = val_inf_pivot->tail;
+ L->numelm = val_inf_pivot->numelm;
+ pivot->pred = L->tail;
+ L->tail->suc = pivot;
+ L->tail = pivot;
+ L->numelm += 1;
+ }
+
+
+ if (!is_empty(val_sup_pivot)) {
+ quick_sort(val_sup_pivot, cmpFct);
+ val_sup_pivot->head->pred = pivot;
+ pivot->suc = val_sup_pivot->head;
+ L->tail = val_sup_pivot->tail;
+ L->numelm += val_sup_pivot->numelm;
+ }
+
+# Etape (5)
+//on liberé leur pointeur respectif
+ free(val_inf_pivot);
+ free(val_sup_pivot);
+ }
+}
+
+
+
+
+
+
-## Getting started
-To make it easy for you to get started with GitLab, here's a list of recommended next steps.
-Already a pro? Just edit this README.md and make it your own. Want to make it easy? [Use the template at the bottom](#editing-this-readme)!
-## Add your files
-- [ ] [Create](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#create-a-file) or [upload](https://docs.gitlab.com/ee/user/project/repository/web_editor.html#upload-a-file) files
-- [ ] [Add files using the command line](https://docs.gitlab.com/ee/gitlab-basics/add-file.html#add-a-file-using-the-command-line) or push an existing Git repository with the following command:
-```
-cd existing_repo
-git remote add origin https://gitlab.univ-lorraine.fr/e87374u/projet_pne.git
-git branch -M main
-git push -uf origin main
-```
-## Integrate with your tools
-- [ ] [Set up project integrations](https://gitlab.univ-lorraine.fr/e87374u/projet_pne/-/settings/integrations)
-## Collaborate with your team
-- [ ] [Invite team members and collaborators](https://docs.gitlab.com/ee/user/project/members/)
-- [ ] [Create a new merge request](https://docs.gitlab.com/ee/user/project/merge_requests/creating_merge_requests.html)
-- [ ] [Automatically close issues from merge requests](https://docs.gitlab.com/ee/user/project/issues/managing_issues.html#closing-issues-automatically)
-- [ ] [Enable merge request approvals](https://docs.gitlab.com/ee/user/project/merge_requests/approvals/)
-- [ ] [Set auto-merge](https://docs.gitlab.com/ee/user/project/merge_requests/merge_when_pipeline_succeeds.html)
-## Test and Deploy
-Use the built-in continuous integration in GitLab.
-- [ ] [Get started with GitLab CI/CD](https://docs.gitlab.com/ee/ci/quick_start/)
-- [ ] [Analyze your code for known vulnerabilities with Static Application Security Testing (SAST)](https://docs.gitlab.com/ee/user/application_security/sast/)
-- [ ] [Deploy to Kubernetes, Amazon EC2, or Amazon ECS using Auto Deploy](https://docs.gitlab.com/ee/topics/autodevops/requirements.html)
-- [ ] [Use pull-based deployments for improved Kubernetes management](https://docs.gitlab.com/ee/user/clusters/agent/)
-- [ ] [Set up protected environments](https://docs.gitlab.com/ee/ci/environments/protected_environments.html)
-***
-# Editing this README
-When you're ready to make this README your own, just edit this file and use the handy template below (or feel free to structure it however you want - this is just a starting point!). Thanks to [makeareadme.com](https://www.makeareadme.com/) for this template.
-## Suggestions for a good README
-Every project is different, so consider which of these sections apply to yours. The sections used in the template are suggestions for most open source projects. Also keep in mind that while a README can be too long and detailed, too long is better than too short. If you think your README is too long, consider utilizing another form of documentation rather than cutting out information.
-## Name
-Choose a self-explaining name for your project.
-## Description
-Let people know what your project can do specifically. Provide context and add a link to any reference visitors might be unfamiliar with. A list of Features or a Background subsection can also be added here. If there are alternatives to your project, this is a good place to list differentiating factors.
-## Badges
-On some READMEs, you may see small images that convey metadata, such as whether or not all the tests are passing for the project. You can use Shields to add some to your README. Many services also have instructions for adding a badge.
-## Visuals
-Depending on what you are making, it can be a good idea to include screenshots or even a video (you'll frequently see GIFs rather than actual videos). Tools like ttygif can help, but check out Asciinema for a more sophisticated method.
-## Installation
-Within a particular ecosystem, there may be a common way of installing things, such as using Yarn, NuGet, or Homebrew. However, consider the possibility that whoever is reading your README is a novice and would like more guidance. Listing specific steps helps remove ambiguity and gets people to using your project as quickly as possible. If it only runs in a specific context like a particular programming language version or operating system or has dependencies that have to be installed manually, also add a Requirements subsection.
-## Usage
-Use examples liberally, and show the expected output if you can. It's helpful to have inline the smallest example of usage that you can demonstrate, while providing links to more sophisticated examples if they are too long to reasonably include in the README.
-## Support
-Tell people where they can go to for help. It can be any combination of an issue tracker, a chat room, an email address, etc.
-## Roadmap
-If you have ideas for releases in the future, it is a good idea to list them in the README.
-## Contributing
-State if you are open to contributions and what your requirements are for accepting them.
-For people who want to make changes to your project, it's helpful to have some documentation on how to get started. Perhaps there is a script that they should run or some environment variables that they need to set. Make these steps explicit. These instructions could also be useful to your future self.
-You can also document commands to lint the code or run tests. These steps help to ensure high code quality and reduce the likelihood that the changes inadvertently break something. Having instructions for running tests is especially helpful if it requires external setup, such as starting a Selenium server for testing in a browser.
-## Authors and acknowledgment
-Show your appreciation to those who have contributed to the project.
-## License
-For open source projects, say how it is licensed.
-## Project status
-If you have run out of energy or time for your project, put a note at the top of the README saying that development has slowed down or stopped completely. Someone may choose to fork your project or volunteer to step in as a maintainer or owner, allowing your project to keep going. You can also make an explicit request for maintainers.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+#outils
+git remote add origin https://gitlab.univ-lorraine.fr/e87374u/projet_pne.git
+git branch -M main
+git push -uf origin main
+
+
--
GitLab