-
Notifications
You must be signed in to change notification settings - Fork 0
/
less_instructions.c
95 lines (85 loc) · 2.28 KB
/
less_instructions.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* less_instructions.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ted-dafi <ted-dafi@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/03/18 14:32:00 by ted-dafi #+# #+# */
/* Updated: 2022/06/15 12:02:22 by ted-dafi ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
int get_index(int *stack, int value)
{
int i;
i = 1;
while (i <= stack[0])
{
if (stack[i] == value)
return (i);
i++;
}
return (-1);
}
int cases_of_multi(char *s)
{
int i;
i = 0;
if (s[0] == s[4] && s[0] != 'p' && s[1] != 'r' && s[1] != s[5])
ft_printf("%c%c\n", s[0], s[0]);
else if (s[0] == s[4] && s[0] != 'p' && s[1] == s[5]
&& s[1] == 'r' && s[2] != s[6])
ft_printf("rrr\n");
else
ft_printf("%s\n%s\n", s, s + 4);
return (1);
}
void up_down(char *s2, char *s3, int *l)
{
if (s2[0] == 'k')
{
if (s3[0] && s3[0] != 'k')
*l = ft_printf("%s\n", s3);
}
else if (s3[0] && s3[4])
*l = cases_of_multi(s3);
}
void print_multi(char *s2)
{
static char s[9];
char s3[9];
int i;
int l;
s[8]++;
s[0] += s2[0] * (s[8] == 1);
s[1] += s2[1] * (s[8] == 1);
s[2] += s2[2] * (s[8] == 1);
s[4] += s2[0] * (s[8] == 2);
s[5] += s2[1] * (s[8] == 2);
s[6] += s2[2] * (s[8] == 2);
l = 0;
i = -1;
while (++i < 9)
s3[i] = s[i];
up_down(s2, s3, &l);
i = 0;
while (i < 9 && l)
s[i++] = 0;
}
void just_sort(t_all *all)
{
int start;
int end;
if (all->a[0] <= 50)
all->offset = all->a[0] / 4;
else
all->offset = (all->a[0] <= 150) * (all->a[0] / 8)
+ (all->a[0] > 150) * (all->a[0] / 20);
all->middle = all->sorted[0] / 2;
start = all->middle - all->offset;
end = all->middle + all->offset;
from_a_to_b(all, start, end);
//from_b_to_a(all);
print_multi("kk");
}