https://github.com/abderrsfa/push_swap
The aim of this project is to sort a stack of numbers, using a limited set of instructions, and the lowest possible number of actions. You will have to look into different types of algorithms and choose the most appropriate one for an optimized solution.
https://github.com/abderrsfa/push_swap
1337 1337school 42born2code 42cursus algorithms c checker pushswap sorting-algorithms
Last synced: about 3 hours ago
JSON representation
The aim of this project is to sort a stack of numbers, using a limited set of instructions, and the lowest possible number of actions. You will have to look into different types of algorithms and choose the most appropriate one for an optimized solution.
- Host: GitHub
- URL: https://github.com/abderrsfa/push_swap
- Owner: AbderrSfa
- License: apache-2.0
- Created: 2021-06-07T18:24:08.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2021-08-09T16:45:51.000Z (almost 4 years ago)
- Last Synced: 2025-05-18T05:08:02.261Z (about 2 months ago)
- Topics: 1337, 1337school, 42born2code, 42cursus, algorithms, c, checker, pushswap, sorting-algorithms
- Language: C
- Homepage:
- Size: 84 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# 🔄 push_swap
# 🧐 Description
The aim of this project is to sort a stack of numbers, using a limited set of instructions, and the lowest possible number of actions. You will have to look into different types of algorithms and choose the most appropriate one for an optimized solution.
## 📖 Synopsis
**push_swap** is a straigh-forward and effective algorithm project: There is data. Said data needs to be sorted.
You have a set of integers, 2 stacks (stack a, and stack b) and a set of instructions to manipulate both stacks.
This project contains 2 programs:
The first, called **push_swap** which will receive a list of integers as arguments. The program must display the smallest list of instructions possible to sort the stack a, the smallest number being at the top.
The second one, **checker** (which is a bonus part of the project), also takes a list of integers and will read instructions on the standard input. Once read,checker executes them and displays OK if the entered insturctions result in the integers being properly sorted. Otherwise, it will display KO.
## 🧰 push_swap instructions
**sa:** swap a - swap the first 2 elements at the top of stack a. Do nothing if there is only one or no elements.
**sb:** swap b - swap the first 2 elements at the top of stack b. Do nothing if there is only one or no elements.
**ss:** sa and sb at the same time.
**pa:** push a - take the first element at the top of b and put it at the top of a. Do nothing if b is empty.
**pb:** push b - take the first element at the top of a and put it at the top of b. Do nothing if a is empty.
**ra:** rotate a - shift up all elements of stack a by 1. The first element becomes the last one.
**rb:** rotate b - shift up all elements of stack b by 1. The first element becomes the last one.
**rr:** ra and rb at the same time.
**rra:** reverse rotate a - shift down all elements of stack a by 1. The last element becomes the first one.
**rrb:** reverse rotate b - shift down all elements of stack b by 1. The last element becomes the first one.
**rrr:** rra and rrb at the same time.
# ⚙️ Compilation
To compile checker, run:
`make checker`
To compile push_swap, run:
`make push_swap`
To compile both, run:
`make`
# 🔧 Usage
***push_swap***
Example: `./push_swap -9 8 3 20 -5`
***checker***
Exapmle: `./checker -9 8 3 20 -5` then will wait for your input
***Both***
To execute both push_swap and checker: `./push_swap -9 8 3 20 -5 | ./checker -9 8 3 20 -5`
