blob: eabf04a5e3e5f93df375ff166cfe54133ea8bcb3 (
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* optimization.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: dkaiser <dkaiser@student.42heilbronn.de +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/04/13 15:25:05 by dkaiser #+# #+# */
/* Updated: 2024/04/15 16:20:51 by dkaiser ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
#include <stdlib.h>
static int *copy_stack(int *stack, int size)
{
int i;
int *cpy;
cpy = malloc(sizeof(int) * size);
if (!cpy)
return NULL;
i = 0;
while (i < size)
{
cpy[i] = stack[i];
i++;
}
return cpy;
}
static void sort_stack(int *stack, int size)
{
int i;
int k;
int tmp;
i = 0;
while (i < size - 1)
{
k = i + 1;
while (k < size)
{
if (stack[i] > stack[k])
{
tmp = stack[i];
stack[i] = stack[k];
stack[k] = tmp;
}
k++;
}
i++;
}
}
static void override_stack(int *stack, int *tmp_stack, int size)
{
int i;
int k;
i = 0;
while (i < size)
{
k = 0;
while (stack[i] != tmp_stack[k])
k++;
stack[i] = k;
i++;
}
}
int stack_optimize(t_stack *stack)
{
int *tmp_stack;
tmp_stack = copy_stack(stack->stack, stack->size);
if (!tmp_stack)
return 1;
sort_stack(tmp_stack, stack->size);
override_stack(stack->stack, tmp_stack, stack->size);
free(tmp_stack);
return 0;
}
|
