{"id":26457203,"url":"https://github.com/tinitiuset/push_swap","last_synced_at":"2025-03-18T22:58:20.504Z","repository":{"id":61938929,"uuid":"548898922","full_name":"tinitiuset/push_swap","owner":"tinitiuset","description":"This project sorts data on a stack, with a limited set of instructions, using the lowest possible number of actions.","archived":false,"fork":false,"pushed_at":"2022-12-05T14:16:55.000Z","size":1412,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2023-03-09T03:46:27.002Z","etag":null,"topics":["42born2code","algorithms-and-data-structures"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":false,"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/tinitiuset.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}},"created_at":"2022-10-10T11:06:37.000Z","updated_at":"2022-12-08T12:41:34.000Z","dependencies_parsed_at":"2023-01-24T05:31:42.168Z","dependency_job_id":null,"html_url":"https://github.com/tinitiuset/push_swap","commit_stats":null,"previous_names":[],"tags_count":null,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tinitiuset%2Fpush_swap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tinitiuset%2Fpush_swap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tinitiuset%2Fpush_swap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tinitiuset%2Fpush_swap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tinitiuset","download_url":"https://codeload.github.com/tinitiuset/push_swap/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244320415,"owners_count":20434092,"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":["42born2code","algorithms-and-data-structures"],"created_at":"2025-03-18T22:58:20.052Z","updated_at":"2025-03-18T22:58:20.492Z","avatar_url":"https://github.com/tinitiuset.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Push_Swap ![norminette](https://github.com/tinitiuset/push_swap/workflows/norminette/badge.svg)\n\nThis sorts data on a stack, with a limited set of instructions, using the lowest possible number of actions.\n\n## Mark:\n![84/100](img/mark.png)","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftinitiuset%2Fpush_swap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftinitiuset%2Fpush_swap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftinitiuset%2Fpush_swap/lists"}