Skip to content

The “push_swap”: Sort the stack with the minimum possible number of operations

Notifications You must be signed in to change notification settings

ManuCiao10/push_swap

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

44 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

push_swap

eardingh's 42 stats

rules

• You have 2 stacks named a and b. • At the beginning: - The stack a contains a random amount of negative and/or positive numbers which cannot be duplicated. - The stack b is empty.

Command

Command Description
sa swap a - swap the first 2 elements at the top of stack a. Do nothing if there is only one or no elements).
sb swap b - swap the first 2 elements at the top of stack b. Do nothing if there is only one or no elements).
ss sa and sb at the same time.
pa push a - take the first element at the top of b and put it at the top of a. Do nothing if b is empty.
pb push b - take the first element at the top of a and put it at the top of b. Do nothing if a is empty.
ra rotate a - shift up all elements of stack a by 1. The first element becomes the last one.
rb rotate b - shift up all elements of stack b by 1. The first element becomes the last one.
rr ra and rb at the same time.
rra reverse rotate a - shift down all elements of stack a by 1. The flast element becomes the first one.
rrb reverse rotate b - shift down all elements of stack b by 1. The flast element becomes the first one.
rrr rra and rrb at the same time.

About

The “push_swap”: Sort the stack with the minimum possible number of operations

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published