Skip to content

🔀 This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting.

Notifications You must be signed in to change notification settings

julienhouyet/42-push_swap

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

49 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

push_swap

42-push_swap

Introduction

This project asks me to sort data on a stack, with a limited set of instructions, using the smallest possible number of actions. To succeed, I need to manipulate different types of algorithms and choose the most appropriate solution (from among several) for optimized data sorting.

At 42 School, almost every project must be written in accordance to the Norm, the school's coding standard. As a result, the implementation of certain parts may appear strange and for sure had room for improvement.

âš¡ Usage

To use this project, compile the project and :

Run the program with random numbers :

$ ./push_swap 2 1 3 6 5 8

🔌 Installation

To install the project, clone this repository :

$ git@github.com:julienhouyet/42-push_swap.git

📦 Commands

To compile the project, run :

$ make

To re-compile the project :

$ make re

To wipes all object files :

$ make clean

To delete the project and all object files

$ make fclean

About

🔀 This project will make you sort data on a stack, with a limited set of instructions, using the lowest possible number of actions. To succeed you’ll have to manipulate various types of algorithms and choose the most appropriate solution (out of many) for an optimized data sorting.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published