Skip to content

push_swap is a sorting algorithm based on sorting two stacks with the least amount of moves.

Notifications You must be signed in to change notification settings

AzerSD/ksort-push_swap

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

push_swap

image

push_swap is a sorting algorithm based on sorting two stacks with the least amount of moves. The allowed moves are:

  • sa (swap a): Swap the first 2 elements at the top of stack a.
  • sb (swap b): Swap the first 2 elements at the top of stack b.
  • 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.
  • pb (push b): Take the first element at the top of a and put it at the top of b.
  • ra (rotate a): Shift up all elements of stack a by 1. First becomes last.
  • rb (rotate b): Shift up all elements of stack b by 1. First becomes last.
  • rr : ra and rb at the same time.
  • rra (reverse rotate a): Shift down all elements of stack a by 1. Last becomes first.
  • rrb (reverse rotate b): Shift down all elements of stack b by 1. Last becomes first.
  • rrr : rra and rrb at the same time.

By using these moves, the goal is to sort the numbers in stack A in ascending order, using stack B as a temporary storage.

This algorithm is considered to be one of the simplest sorting algorithm, but it can be quite hard to optimize it and sort a large amount of numbers with a low amount of moves.

The Algorithm:

Screen.Recording.2023-01-18.at.8.20.00.AM.mov

ksort

About

push_swap is a sorting algorithm based on sorting two stacks with the least amount of moves.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published