This project involves sorting data on a stack, with a limited set of instructions, and the smallest number of moves. To make this happen, you will have to manipulate various sorting algorithms and choose the most appropriate solution(s) for optimized data sorting.
-
Notifications
You must be signed in to change notification settings - Fork 0
alvachon/42_push_swap
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This project involves sorting data on a stack Sorted with a derived version of the sandwich theorem and with doubly circular linked ist
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published