In this project I used the algo "Turcsort" to sort the stack a. It picks the cheapest number in terms of operations and moves them to stacks b until there are only 3 numbers in stack a. Then it will the 3 numbers from stack a and move the numbers from stack b to a. Eventually it will move the min of stack a to the top of stack a. The algo has a runtime of o(n^2)...
-
Notifications
You must be signed in to change notification settings - Fork 0
In this project, you will sort data in a stack using a limited set of instructions, aiming to achieve the lowest possible number of actions. To succeed, you will need to work with various algorithms and choose the most appropriate one for optimized data sorting.
WaPoco/push_swap
About
In this project, you will sort data in a stack using a limited set of instructions, aiming to achieve the lowest possible number of actions. To succeed, you will need to work with various algorithms and choose the most appropriate one for optimized data sorting.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published