blob: 209a1b80c9e523336b58e5d235c2807fb3549274 (
plain)
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
|
/*
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"
int find_smallest(t_list *stack)
{
int smallest;
int position;
smallest = stack->value;
position = stack->index;
while (stack)
{
if (stack->value < smallest)
{
smallest = stack->value;
position = stack->index;
}
stack = stack->next;
}
return (position);
}
void move_smallest_value_dst(t_list **src, t_list **dst,
int position_smallest_value)
{
int i;
i = 0;
if (position_smallest_value < ft_lstsize(*src))
while (i++ < position_smallest_value)
ra(src);
if (position_smallest_value > ft_lstsize(*src))
while (i++ < position_smallest_value)
rra(src);
pb(src, dst);
}
void reset_index(t_list *stack)
{
int i;
i = 0;
while (stack->next != NULL)
{
stack->index = i++;
stack = stack->next;
}
stack->index = i;
}
|
