doing the norm

algorithms/insertion/insertion.c

@@ -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++;

algorithms/medium/utils_medium.c

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

algorithms/medium/utils_medium_two.c

@@ -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)
 	{

flags/flag.c

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

test_one.c

@@ -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)
+	free_all(piles);
-		stack_clear_all(piles->a, piles->a);
-	if (piles->b)
-		stack_clear_all(piles->b, piles->b);
 	free(piles);
 	return (0);
 }