-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsort_small.c
106 lines (98 loc) · 2.53 KB
/
sort_small.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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* sort_small.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: denizozd <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/01/04 17:50:09 by denizozd #+# #+# */
/* Updated: 2024/05/26 18:29:56 by denizozd ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
/* Sorts two numbers in ascending order. */
t_node *sort_2(t_node *head_a)
{
if (head_a->nbr > head_a->next->nbr)
sa(&head_a);
return (head_a);
}
/* Sorts three numbers in ascending order. */
t_node *sort_3(t_node *head_a)
{
int a;
int b;
int c;
a = head_a->nbr;
b = head_a->next->nbr;
c = head_a->next->next->nbr;
if (a < b && b > c && a < c)
{
sa(&head_a);
ra(&head_a);
}
else if (a > b && b < c && a < c)
sa(&head_a);
else if (a < b && b > c && a > c)
rra(&head_a);
else if (a > b && b < c && a > c)
ra(&head_a);
else if (a > b && b > c && a > c)
{
sa(&head_a);
rra(&head_a);
}
return (head_a);
}
/* Sorts four numbers in ascending order. */
t_node *sort_4(t_node *head_a, t_node *head_b)
{
int i;
int min_pos;
i = 2;
while (i--)
{
min_pos = position_min_nbr(head_a);
if (min_pos == 1)
ra(&head_a);
if (min_pos == 2)
{
ra(&head_a);
ra(&head_a);
}
if (min_pos == 3)
rra(&head_a);
pb(&head_a, &head_b);
}
head_a = sort_2(head_a);
pa(&head_b, &head_a);
pa(&head_b, &head_a);
return (head_a);
}
/* Sorts five numbers in ascending order. */
t_node *sort_5(t_node *head_a, t_node *head_b)
{
int min_pos;
min_pos = position_min_nbr(head_a);
if (min_pos == 1 || min_pos == 2)
ra(&head_a);
if (min_pos == 2)
ra(&head_a);
if (min_pos == 3)
rra(&head_a);
if (min_pos == 3 || min_pos == 4)
rra(&head_a);
pb(&head_a, &head_b);
min_pos = position_min_nbr(head_a);
if (min_pos == 1 || min_pos == 2)
ra(&head_a);
if (min_pos == 2)
ra(&head_a);
if (min_pos == 3)
rra(&head_a);
pb(&head_a, &head_b);
head_a = sort_3(head_a);
pa(&head_b, &head_a);
pa(&head_b, &head_a);
return (head_a);
}