https://github.com/yvann-ba/push_swap
Efficient stack sorting algorithm in C. Optimize the number of moves using limited operations
https://github.com/yvann-ba/push_swap
42cursus cprogramming optimization sortingalgorithms
Last synced: 2 months ago
JSON representation
Efficient stack sorting algorithm in C. Optimize the number of moves using limited operations
- Host: GitHub
- URL: https://github.com/yvann-ba/push_swap
- Owner: yvann-ba
- Created: 2024-06-15T14:58:19.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-09-30T14:45:09.000Z (9 months ago)
- Last Synced: 2025-02-13T19:52:54.518Z (4 months ago)
- Topics: 42cursus, cprogramming, optimization, sortingalgorithms
- Language: C
- Homepage:
- Size: 1.52 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Push_Swap
## 📜 Description
"Push_Swap" is a challenging algorithmic project from 42 School. The goal is to sort a stack of integers using a limited set of operations, aiming to minimize the number of moves required. This project enhances your understanding of sorting algorithms, data structures, and algorithm optimization.
#### ⭐ My 42 score for this project:
#### 📄 Official 42 School Subject:
[Push_Swap Subject](https://github.com/yvann-ba/Push_Swap/blob/main/en.subject.pdf)
## 🌟 Features
- Efficiently sort a stack of integers
- Limited and defined operations
- Optimization of moves
- Comprehensive algorithm analysis
## ⚙️ Installation
To clone and compile this project, follow these steps:
```bash
git clone https://github.com/yvann-ba/Push_Swap.git
cd Push_Swap
make
```
## 🚀 Usage
To sort a stack of integers, execute the following command:
```
./push_swap "3 2 1"
```
Replace "3 2 1" with any sequence of integers. The program will output the steps to sort the stack