git clone --recurse-submodules https://github.com/avsrb/push_swap.git; cd push_swap; make
ARG=`ruby -e "puts (1..500).to_a.shuffle.join(' ')"`; ./push_swap $ARG | ./checker -vcat $ARG
Watch this video https://youtu.be/oUbuTOryf5o . You have two stacks called Stack A and Stack B. Stack A is given a random list of unorganized numbers. You must take the random list of numbers in Stack A and sort them so that Stack A is organized from smallest to largest. There are only a few moves you’re allowed to used to manipulate the stacks. The main goal of this project is to organize Stack A in as few actions as possible.
git clone --recurse-submodules https://github.com/avsrb/push_swap.git; cd push_swap; make
ARG=`ruby -e "puts (1..500).to_a.shuffle.join(' ')"`; ./push_swap $ARG | ./checker -vcat $ARG
Watch this video https://youtu.be/oUbuTOryf5o . You have two stacks called Stack A and Stack B. Stack A is given a random list of unorganized numbers. You must take the random list of numbers in Stack A and sort them so that Stack A is organized from smallest to largest. There are only a few moves you’re allowed to used to manipulate the stacks. The main goal of this project is to organize Stack A in as few actions as possible.