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

doing the norm

Browse Source
This commit is contained in:
Maoake Teriierooiterai
2026-01-07 13:23:42 +01:00
parent 93e8c10b27
commit e1351b4d2f
9 changed files with 9 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
algorithms/insertion/insertion.c
View File

@@ -24,7 +24,8 @@ static int to_insert(t_stacks *stacks, int sorted)
a = stacks->a;
while (i < sorted)
{
if (stacks->b->value > a->previous->value && stacks->b->value <= a->value)
if (stacks->b->value > a->previous->value
&& stacks->b->value <= a->value)
return (i);
a = a->previous;
i++;

1
algorithms/medium/utils_medium.c
View File

@@ -53,7 +53,6 @@ int calcul_range(int value, int range)
{
int max_range;
max_range = 0;
if (value < 0)
while (max_range > value)

2
algorithms/medium/utils_medium_two.c
View File

@@ -64,7 +64,7 @@ int range_bucket(t_stack *first)
int sqrt;
len = stack_len(first);
diff = (get_max_number(first) - get_min_number(first)) ;
diff = get_max_number(first) - get_min_number(first);
sqrt = my_sqrt(len);
if (diff / sqrt < 2)
{

1
flags/flag.c
View File

@@ -25,5 +25,4 @@ void flags(int pos, char **argv, t_stacks *piles)
adaptive(piles);
else
adaptive(piles);
}

5
test_one.c
View File

@@ -28,10 +28,7 @@ int test1(int argc, char **argv)
preset = get_tabs(piles->a, range_bucket(piles->a));
bucket_algo(piles, preset, range_bucket(piles->a));
}
if (piles->a)
stack_clear_all(piles->a, piles->a);
if (piles->b)
stack_clear_all(piles->b, piles->b);
free_all(piles);
free(piles);
return (0);
}