1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
|
/*
sort_stack Copyright (C) 2026 yctct
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "../include/push_swap.h"
void double_rrr(int position_a, int position_b, t_list **src, t_list **dst)
{
int i;
while ((ft_lstsize(*src) != position_a) && (ft_lstsize(*dst)) != position_b)
{
rrr(src, dst);
position_a++;
position_b++;
}
i = 0;
while (i++ < (ft_lstsize(*dst)) - position_b)
rrb(dst);
i = 0;
while (i++ < (ft_lstsize(*src)) - position_a)
rra(src);
}
void double_rr(int position_a, int position_b, t_list **src, t_list **dst)
{
int i;
while (position_a && position_b)
{
rr(src, dst);
position_a--;
position_b--;
}
i = 0;
while (i++ < position_b)
rb(dst);
i = 0;
while (i++ < position_a)
ra(src);
}
void single_r(int position_a, int position_b, t_list **src, t_list **dst)
{
int i;
i = 0;
if (position_b > ft_lstsize(*dst) / 2)
{
while (i++ < (ft_lstsize(*dst)) - position_b)
rrb(dst);
}
else
{
while (i++ < position_b)
rb(dst);
}
i = 0;
if (position_a > ft_lstsize(*src) / 2)
{
while (i++ < (ft_lstsize(*src)) - position_a)
rra(src);
}
else
{
while (i++ < position_a)
ra(src);
}
}
void rotate_stacks(int position_a, int position_b, t_list **src,
t_list **dst)
{
if ((position_a > ft_lstsize(*src) / 2) && (position_b > ft_lstsize(*dst)
/ 2))
double_rrr(position_a, position_b, src, dst);
else if ((position_a < ft_lstsize(*src) / 2)
&& (position_b < ft_lstsize(*dst) / 2))
double_rr(position_a, position_b, src, dst);
else
single_r(position_a, position_b, src, dst);
}
|
