da7e/42-Push_Swap
1
0
Fork 0
mirror of https://github.com/DavidGailleton/42-Push_Swap.git synced 2026-01-27 00:41:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

finish the parsing solve the problem with 2 arg

Browse Source
This commit is contained in:
Maoake Teriierooiterai
2026-01-08 19:02:13 +01:00
parent 00e01ed1f9
commit 0df082065e
4 changed files with 18 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
algorithms/utils/pre_sort.c
View File

@@ -35,6 +35,11 @@ int r_to_lowest(t_stack *stack, int len)
return (lowest_i);
}
void sort_two(t_stacks *stacks)
{
sa(stacks);
}
void sort_three_a(t_stacks *stacks)
{
if (check_order(stacks->a))

7
flags/algorithms_sort.c
View File

@@ -26,12 +26,19 @@ void medium(t_stacks *piles)
{
t_tab *buckets;
int range;
int len;
piles->algo = 2;
len = stack_a_len(piles);
if (len == 2)
sort_two(piles);
else
{
range = range_bucket(piles->a);
buckets = get_tabs(piles->a, range);
bucket_algo(piles, buckets, range);
}
}
void complex(t_stacks *piles)
{

1
headers/push_swap.h
View File

@@ -67,6 +67,7 @@ int highest_stack_len(t_stacks *stacks);
/* PRE SORT */
int r_to_lowest(t_stack *stack, int len);
void sort_three_a(t_stacks *stacks);
void sort_two(t_stacks *stacks);
/* ITERATE FILE */
void optimal_rotate(t_stacks *stacks, int i, int len, char stack);
/* COMPARE FILE */

2
test_one.c
View File

@@ -25,6 +25,8 @@ int test1(int argc, char **argv)
piles = NULL;
mod = calcul_mod(argc, argv);
piles = init_piles(argc, argv, mod);
if (check_order(piles->a))
return (0);
flags(pos_flag(argv, mod), pos_bench(argv, mod), argv, piles);
if (piles->bench == 1)
print_bench(piles);