{"id":20205775,"url":"https://github.com/raveriss/push_swap","last_synced_at":"2026-05-12T19:44:04.941Z","repository":{"id":228478423,"uuid":"774103872","full_name":"raveriss/push_swap","owner":"raveriss","description":"Sorting data on a stack with a limited set of instructions, aiming for maximum efficiency.\"","archived":false,"fork":false,"pushed_at":"2024-07-08T13:32:17.000Z","size":32,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-13T20:47:11.227Z","etag":null,"topics":["42school","algorithm","data-sorting"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/raveriss.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null}},"created_at":"2024-03-19T00:21:39.000Z","updated_at":"2024-07-08T13:32:20.000Z","dependencies_parsed_at":"2024-03-19T01:48:35.583Z","dependency_job_id":null,"html_url":"https://github.com/raveriss/push_swap","commit_stats":null,"previous_names":["raveriss/push_swap"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raveriss%2Fpush_swap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raveriss%2Fpush_swap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raveriss%2Fpush_swap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/raveriss%2Fpush_swap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/raveriss","download_url":"https://codeload.github.com/raveriss/push_swap/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241644544,"owners_count":19996177,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["42school","algorithm","data-sorting"],"created_at":"2024-11-14T05:19:07.373Z","updated_at":"2026-05-12T19:44:02.699Z","avatar_url":"https://github.com/raveriss.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Projet push_swap\n\n\u003cdiv align=\"center\"\u003e\n  \u003cimg src=\"https://github.com/ayogun/42-project-badges/raw/main/badges/push_swape.png?raw=true\" alt=\"Badge du projet push_swap\"\u003e\n\u003c/div\u003e\n\n## Description\n\nCe projet a pour but de trier des données sur une pile, en utilisant un ensemble limité d'instructions, et ce, avec le moins d'actions possible. Il s'agit d'appliquer divers types d'algorithmes pour choisir la solution la plus appropriée et optimisée pour un tri de données efficace.\n\n## Tableau des Composants du Projet\n\n| Fichier            | Description                                                               | Responsabilité                                         | Statut   |\n|--------------------|---------------------------------------------------------------------------|--------------------------------------------------------|----------|\n| `main.c`           | Fichier principal, initialise le programme                                | Initialisation, gestion des arguments                  | Complet  |\n| `stack_operations.c`| Gère les opérations sur les piles (push, swap, rotate)                    | Manipulation des piles                                 | Complet  |\n| `sorting_logic.c`  | Implémente la logique de tri                                              | Tri des nombres                                        | Complet  |\n| `utils.c`          | Fonctions utilitaires pour le traitement des données et des erreurs       | Assistance générale                                    | Complet  |\n| `validator.c`      | Valide les entrées et les états des piles                                 | Validation des entrées, vérification de l'état du tri | Complet  |\n| `Makefile`         | Fichier pour compiler le projet                                           | Compilation                                            | Complet  |\n| `push_swap.h`      | Fichier d'en-tête contenant les déclarations et les macros                | Déclarations                                           | Complet  |\n\n## Installation et Compilation\n\n```bash\ngit clone git@github.com:raveriss/push_swap.git\ncd push_swap\nmake\n```\n\n## Utilisation\n```\n./push_swap [liste_de_nombres]\n```\n\n## Caractéristiques\nManipulation efficace des piles pour le tri de données.\nUtilisation minimale d'instructions pour un tri optimisé.\nGestion d'erreurs et validation des entrées pour une robustesse maximale.\nAucune fuite de mémoire, conformément aux standards de l'école 42.\n\n## Fonctions externes autorisées\n- malloc\n- free\n- read\n- write\n- exit\n\n## Precausion contre\n- 17014118346046923169479381556846500249895215313\n- 00000000000000000000000000000000000000000000003\n- +150\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraveriss%2Fpush_swap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fraveriss%2Fpush_swap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fraveriss%2Fpush_swap/lists"}