{"id":18418904,"url":"https://github.com/trobert42/push_swap","last_synced_at":"2025-04-13T06:11:36.698Z","repository":{"id":224101854,"uuid":"685709512","full_name":"trobert42/push_swap","owner":"trobert42","description":"Sorting numbers with two stacks in C","archived":false,"fork":false,"pushed_at":"2024-02-24T12:20:30.000Z","size":64,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-16T06:44:50.423Z","etag":null,"topics":["chained-list","optimization-algorithms","sorting-algorithms"],"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/trobert42.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,"publiccode":null,"codemeta":null}},"created_at":"2023-08-31T20:40:22.000Z","updated_at":"2024-02-23T17:41:44.000Z","dependencies_parsed_at":"2024-02-23T19:41:23.785Z","dependency_job_id":"dcff9d67-0d1e-4f8a-88d2-2d5c3728e6da","html_url":"https://github.com/trobert42/push_swap","commit_stats":null,"previous_names":["trobert42/push_swap"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trobert42%2Fpush_swap","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trobert42%2Fpush_swap/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trobert42%2Fpush_swap/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/trobert42%2Fpush_swap/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/trobert42","download_url":"https://codeload.github.com/trobert42/push_swap/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248670434,"owners_count":21142904,"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":["chained-list","optimization-algorithms","sorting-algorithms"],"created_at":"2024-11-06T04:14:56.835Z","updated_at":"2025-04-13T06:11:36.665Z","avatar_url":"https://github.com/trobert42.png","language":"C","readme":"# Sorting integers with two stacks\n\nThe Push_swap project involves sorting an array of integers using two stacks and a set of instructions. The goal is to create a program that sorts the integers received as arguments. This project aims to teach basic algorithms, complexity concepts, and C language programming. The instructions include writing code in C, adhering to coding norms and properly freeing heap-allocated memory space. The stacks 'a' and 'b' contain unique integers, and the task is to sort stack 'a' in ascending order using instructions such as sa, sb, ss, pa, pb, ra, rb, rra, and rrb, which swap, push, and rotate elements within the stacks.\n\n|    Project Name    |                                                                       push_swap                                                                      |\n| :----------------: | :-------------------------------------------------------------------------------------------------------------------------------------------------: |\n|    Description     |                                             A sorting algorithm using stacks with a limited set of instrutions and using the lowest possible number of actions                                              |\n|    Technologies    | \u003ca href=\"#\"\u003e\u003cimg alt=\"C\" src=\"https://custom-icon-badges.demolab.com/badge/C-03599C.svg?logo=c-in-hexagon\u0026logoColor=white\u0026style=for-the-badge\"\u003e\u003c/a\u003e |\n| External libraries |     read(), write(), malloc(), free(), exit()      |\n\n## Usage\n\n```bash\n  gcl https://github.com/trobert42/push_swap.git\n  cd push_swap\n  make\n  ./push_swap [list of numbers]\n```\n\n## 💬\nBig thanks to Nicolas for helping me understand the LIS (Longest Increasing Subsequence), on which i based my sorting code on it o/ \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftrobert42%2Fpush_swap","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftrobert42%2Fpush_swap","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftrobert42%2Fpush_swap/lists"}