https://github.com/kuninoto/42_push_swap
A program that sorts a stack of integers in the least steps possible, based on a limited set of instructions
https://github.com/kuninoto/42_push_swap
42 42-school 42born2code 42cursus 42porto 42portugal 42projects 42pushswap 42school ecole42 push-swap push-swap42
Last synced: 7 months ago
JSON representation
A program that sorts a stack of integers in the least steps possible, based on a limited set of instructions
- Host: GitHub
- URL: https://github.com/kuninoto/42_push_swap
- Owner: Kuninoto
- Created: 2022-11-27T17:05:44.000Z (almost 3 years ago)
- Default Branch: master
- Last Pushed: 2023-06-25T17:43:33.000Z (over 2 years ago)
- Last Synced: 2025-01-10T04:20:23.956Z (9 months ago)
- Topics: 42, 42-school, 42born2code, 42cursus, 42porto, 42portugal, 42projects, 42pushswap, 42school, ecole42, push-swap, push-swap42
- Language: C
- Homepage:
- Size: 1.61 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# push_swap (42Porto - 42Cursus) 
## Grade: 90/100
### Overview:
_Push_swap_ is a program that sorts a stack of integers with the minimum instructions possible and an auxiliary stack.
Instructions are defined within the subject of the project; They're the only way allowed to
manipulate the data in the stacks.
_checker_ is a utility program that, taking the same arguments as _push_swap_ and its outputted
instructions, checks if the stack ends up sorted, thus verifying if _push_swap_ is correctly sorting the stack
### Screenshot:
### Installing and running the project:
1- Clone this repository
git clone https://github.com/Kuninoto/42_push_swap
2- Navigate to _lvl_2_push_swap_ and run `make`
cd 42_push_swap/lvl_2_push_swap && make
3- `make clean` so that you don't keep those object files that you won't need anymore
make clean
4- Run _push_swap_ with a list of integers of your choice!
./push_swap ...
### Subject (v6): [push_swap en_subject](./extras/en.subject_push_swap.pdf)
## Note:
Although I was only able to do an algorithm that gives 90/100 in this project (i.e the bonus part cannot be accessed on the evaluation)
I've still made the bonus part because I found it interesting and quite easy. I left it on bonus folder for the record.
#### Makefile Available Targets:
`make` or `make all` - Makes _push_swap_
`make clean` - Deletes all the resulting object files
`make fclean` - Deletes _push_swap_ and _checker_
`make re` - fclean + all
`make bonus` - Makes _checker_
### Useful links:
- [Medium article about the project](https://medium.com/@jamierobertdawson/push-swap-the-least-amount-of-moves-with-two-stacks-d1e76a71789a)
- [Another medium Article about the project](https://medium.com/nerd-for-tech/push-swap-tutorial-fa746e6aba1e)
- [Insertion Sort](https://www.geeksforgeeks.org/insertion-sort/)
- [Merge Sort](https://www.geeksforgeeks.org/merge-sort/)
- [Quick Sort](https://www.geeksforgeeks.org/quick-sort/)
- [Algorithm from another 42 student](https://www.youtube.com/watch?v=7KW59UO55TQ)
- [Handy random number generator to test the program](https://numbergenerator.org/randomnumbergenerator/1-100#!numbers=500&low=1&high=500&unique=true&csv=&oddeven=&oddqty=0&sorted=false&addfilters=)
## Disclaimer
> At [42School](https://en.wikipedia.org/wiki/42_(school)), almost every project must be written in accordance to the [Norm](./extras/en_norm.pdf), the schools' coding standard. As a result, the implementation of certain parts may appear strange and for sure had room for improvement.
---
Made by Nuno Carvalho (Kuninoto) | nnuno-ca@student.42porto.com
