https://github.com/andersonhsporto/ft-push-swap
Sort Data on a Stack, With a Limited Set of Instructions, Using the Lowest Possible Number of Actions
https://github.com/andersonhsporto/ft-push-swap
algorithm algorithm-implementations c linked-list linked-list-in-c merge-sort merge-sort-algorithm sorting-algorithms
Last synced: 4 months ago
JSON representation
Sort Data on a Stack, With a Limited Set of Instructions, Using the Lowest Possible Number of Actions
- Host: GitHub
- URL: https://github.com/andersonhsporto/ft-push-swap
- Owner: andersonhsporto
- Created: 2021-11-20T21:32:18.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2022-03-24T00:11:33.000Z (over 3 years ago)
- Last Synced: 2025-01-17T05:29:08.568Z (5 months ago)
- Topics: algorithm, algorithm-implementations, c, linked-list, linked-list-in-c, merge-sort, merge-sort-algorithm, sorting-algorithms
- Language: C
- Homepage:
- Size: 9.61 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ft-push-swap
### O objetivo deste projeto é ordenar números inteiros em uma stack utilizando um conjunto limitado de operações utilizando C.
Funções Permitidas
As funções permitidas no escopo deste projeto são:
```
• write
• read
• malloc
• free
• exit
```
Compile o programa utilizando **make**, o programa pode ser executado da seguinte forma:
```sh
./push_swap 9 8 7 6 5 4
ARG=`ruby -e "puts (1..100).to_a.shuffle.join(' ')"`; ./push_swap $ARG
```
## Visualização
Execução com 100 números aleatórios: *utilizando o visualizador em python [push_swap_visualizer](https://github.com/o-reo/push_swap_visualizer).
