-
Notifications
You must be signed in to change notification settings - Fork 0
/
lis_sort.c
83 lines (76 loc) · 1.99 KB
/
lis_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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* lis_algo.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: brulutaj <brulutaj@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/04/25 16:02:12 by brulutaj #+# #+# */
/* Updated: 2024/04/30 17:47:53 by brulutaj ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
int *lis_algo(t_dll *head, int *n)
{
t_dll *tmp;
int *lis_array;
int size;
int max;
if (!head)
return ((void *)0);
tmp = head;
size = dll_size(head);
max = tmp->value;
lis_array = ft_calloc(size, sizeof(int));
if (!lis_array)
return ((void *)0);
lis_array[0] = tmp->index;
while (tmp->next != NULL)
{
if (tmp->next->value > max)
{
(*n)++;
lis_array[*n - 1] = tmp->next->index;
max = tmp->next->value;
}
tmp = tmp->next;
}
return (lis_array);
}
t_dll *handling_lis(t_dll **stack_a, int *index_a, int lis_size)
{
int index;
int size_a;
int i;
t_dll *stack_b;
i = 0;
index = 0;
(void)lis_size;
size_a = dll_size(*stack_a);
stack_b = NULL;
while (index < size_a)
{
if (index == index_a[i])
{
rotate(stack_a, &stack_b, MOVE_A);
i++;
}
else
pb(&stack_b, stack_a);
index++;
}
free(index_a);
return (stack_b);
}
t_dll *get_stack_lis(t_dll **stack_a)
{
t_dll *stack_b;
int *index_a;
int lis_size;
int i;
lis_size = 1;
i = 0;
index_a = lis_algo(*stack_a, &lis_size);
stack_b = handling_lis(stack_a, index_a, lis_size);
return (stack_b);
}