blob: a00d8c94b86722c428a578766340de7c5ac0ef35 (
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
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/*
sort_stack Copyright (C) 2026 yctct
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <https://www.gnu.org/licenses/>.
*/
#include "../include/push_swap.h"
#include <stdlib.h>
int is_sorted(t_list *stack)
{
t_list *current;
t_list *second;
// t_list *next;
current = stack;
//next = stack->next;
while (current)
{
second = current->next;
while (second)
{
if (current->value > second->value)
return (0);
second = second->next;
}
current = current->next;
}
return (1);
}
void *init_stack(char **array)
{
t_list *node;
long number;
int index_count;
t_list *stack;
stack = NULL;
index_count = 0;
while (array[index_count])
index_count++;
while (index_count > 0)
{
number = ft_atoi(array[index_count - 1]);
node = malloc(sizeof(t_list));
if (!node)
return (NULL);
node->value = number;
node->index = (index_count - 1);
node->next = stack;
stack = node;
index_count--;
}
return (stack);
}
t_list *convert_string(char *s, t_list *src)
{
char **array;
array = ft_split(s, ' ');
if (array == NULL)
return (NULL);
if (array[0] == NULL)
{
free_array(array);
return (NULL);
}
if (!is_valid_int(array))
{
free_array(array);
puterror(src);
}
src = init_stack(array);
free_array(array);
check_errors(src);
return (src);
}
void select_sort(t_list *src)
{
if (ft_lstsize(src) < 3)
sort_two(&src);
else if (ft_lstsize(src) < 4)
sort_three(&src);
else if (ft_lstsize(src) < 6)
sort_five(&src);
else
sort(&src);
free_stack(src);
}
int main(int argc, char **argv)
{
t_list *src;
src = NULL;
if (argc == 1)
return (0);
if (argc == 2)
{
src = convert_string(argv[1], src);
if (src == NULL)
{
free(src);
return (0);
}
}
else
{
if (!is_valid_int(&argv[1]))
puterror(src);
src = init_stack(&argv[1]);
check_errors(src);
}
if (is_sorted(src))
return (free_stack(src), 0);
select_sort(src);
}
|
