-
Notifications
You must be signed in to change notification settings - Fork 0
/
push_swap_sort.c
110 lines (101 loc) · 2.36 KB
/
push_swap_sort.c
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
97
98
99
100
101
102
103
104
105
106
107
108
109
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* push_swap_sort.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mokhan <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2023/12/22 15:20:40 by mokhan #+# #+# */
/* Updated: 2023/12/22 15:20:41 by mokhan ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
void sort3(t_data *d)
{
int x;
int y;
int z;
x = d->a->i;
y = d->a->nxt->i;
z = d->a->nxt->nxt->i;
if (x > y && y < z && x < z)
cmd_sp(d, "sa");
else if (x > y && y > z && x > z)
{
cmd_sp(d, "sa");
cmd_sp(d, "rra");
}
else if (x < y && y > z && x < z)
{
cmd_sp(d, "sa");
cmd_sp(d, "ra");
}
else if (x > y && y < z && x > z)
cmd_sp(d, "ra");
else if (x < y && y > z && x > z)
cmd_sp(d, "rra");
}
void sort5(t_data *d)
{
while (ps_lstsize(d->a) > 3)
cmd_sp(d, "pb");
sort3(d);
if (d->size == 5)
{
if (d->b->i == 3 && d->b->nxt->i == 2)
cmd_sp(d, "rr");
else if (d->b->i == 3 && d->b->nxt->i == 4)
cmd_sp(d, "rrr");
else if (d->b->i == 3)
cmd_sp(d, "sb");
}
while (d->b != NULL)
{
if (d->b->i == d->a->i - 1 || (d->b->i == ps_lstlast(d->a)->i + 1))
cmd_sp(d, "pa");
else if (d->b->i == d->a->nxt->i - 1)
cmd_sp(d, "ra");
else
cmd_sp(d, "rra");
}
}
int get_min(t_stack *a)
{
int steps;
t_stack *tmp;
steps = 0;
tmp = a;
while (tmp->i != ps_lstmin(tmp))
{
tmp = tmp->nxt;
steps++;
}
return (steps);
}
void do_sort(t_data *d)
{
int min;
if (d->size == 2 && d->a->i > d->a->nxt->i)
cmd_sp(d, "sa");
else if (d->size <= 3)
sort3(d);
else if (d->size <= 5)
sort5(d);
else
{
pushb(d);
sort3(d);
pusha(d);
}
min = get_min(d->a);
if (min <= ps_lstsize(d->a) / 2)
{
while (d->a->i != ps_lstmin(d->a))
cmd_sp(d, "ra");
}
else
{
while (d->a->i != ps_lstmin(d->a))
cmd_sp(d, "rra");
}
}