Algorithm  pin3dev/42_Push_Swap GitHub Wiki
Theory
The Turkish Algorithm has a simple goal:
ℹ️ To organize the numbers in stack A, push it in descending order into stack B (
pb
) and then bring them back to stack A, leaving it in ascending order (pa
).
Sorting Types
1. Sort Three
ℹ️ For ordering up to 3 nodes it is not necessary to use stack B, with only internal rotation and swap movements being effective in all cases.
case 1  case 2  case 3  case 4  case 5 

acb 
bac 
bca 
cab 
cba 
1 ,3 ,2 
2 ,1 ,3 
2 ,3 ,1 
3 ,1 ,2 
3 ,2 ,1 
swap +rot 
swap 
revrot 
rot 
swap +revrot 
2. Big Sort
ℹ️ Sorting method for sorting a stack with more than 3 nodes. Here's the steps how the big sort works:

Step 1:
It pushes the first 2 nodes to stack B, one after the other, using thepb
move. 
Step 2:
With the 2 new nodes in stack B, it determines which node has thehighest
andlowest
integer values, marking them as the "new maximum value" and "new minimum value" in stack B. 
Step 3:
Next, the algorithm goes into a loop, searching only for thebest case
to move, found by each round, until only 3 nodes remain in stack A.
🚨 The "best case" It evaluates by considering which node in stack A have the lowest
Total_Mov
2.1. Rules
ℹ️ Some features have been added for the algorithm to run, and will be explained in the future, but these features depend on the concept of sorting the stack B, which follows two possible rules to determine the destination (
Dest_Position
) of the node to be transferred (stack A) into stack B.
The "Dest_Position" rules:
 Rule 1:
If the value of the node to be transferred (stack A) is less than the minimum value (node < min
) or greater than the current maximum value in stack B (node > max
), it is placed ontop
of the node with thehighest
value in stack B so far.  Rule 2:
If the value of the node does not follow the previous rule, it is placed ontop
of the node with the valueimmediately lower
than it in stack B.
3. Returning Ordination
ℹ️ To return from stack B to stack A (
pa
), it’s just moving the number from thetop
of stack B to itsDest_Position
on stack A.
It is important to mention that the entireDest_Position
logic is inverted, with the number always positioned at the top of the numberimmediately greater
than it.
🚨 Checking the “best case”, are dispensed with in this part of the algorithm.
ℹ️ Once all the nodes are back in stack A, find the min value, and according to the settings of the features (
Mov
andMov_Orientation
) rotate stack A until the node with this value is at the top.