Change simple algo for adaptive requierement to 02 max + norminette

algorithms/medium/medium_algo.c

@@ -34,7 +34,7 @@ void	bucket_algo(t_stacks *stacks, t_tab *preset, int range)
 	t_tab	*tmp;
 
 	tmp = preset;
-	while(stacks->a)
+	while (stacks->a)
 		pb(stacks);
 	while (preset)
 	{

algorithms/medium/move_patha.c

@@ -12,7 +12,7 @@
 
 #include "medium_headers.h"
 #include "push_swap.h"
-#include <stdio.h>
+
 static int	is_border_a(int value, t_stacks *stacks)
 {
 	t_stack	*tmp;
@@ -22,7 +22,7 @@ static int	is_border_a(int value, t_stacks *stacks)
 	tmp = assign_stack(stacks, 'a');
 	if ((value < tmp->index && check_order(tmp))
 		|| (value > tmp->index && value > tmp->previous->index
-		&& check_order(stacks->a)))
+			&& check_order(stacks->a)))
 		return (1);
 	return (0);
 }

algorithms/medium/move_pathb.c

@@ -104,10 +104,12 @@ int	get_pre_move_b(t_stacks *stacks, t_tab *one_preset, int range)
 		}
 	}
 	else
+	{
 		while (!in_range(tmp->index, one_preset->max_range, range))
 		{
 			i++;
 			tmp = tmp->previous;
 		}
+	}
 	return (i);
 }

algorithms/medium/sort_utils.c

@@ -12,7 +12,7 @@
 
 #include "push_swap.h"
 #include "medium_headers.h"
-#include <stdio.h>
+
 void	move_rr_rrr(t_stacks *stacks, int move, char c)
 {
 	int	i;
@@ -64,7 +64,6 @@ void	path_rr_rrr(int value, t_stacks *stacks, t_tab *one_preset, int range)
 			final_move = move_a;
 		move_rr_rrr(stacks, final_move, 'e');
 	}
-
 }
 
 void	push_range_to_b(t_stacks *stacks, t_tab *one_preset, int range)

algorithms/medium/sort_utils_two.c

@@ -15,7 +15,7 @@
 
 int	get_value_finded(t_stacks *stacks, t_tab *one_preset, int range)
 {
-	int	value;
+	int		value;
 	t_stack	*tmp;
 
 	tmp = assign_stack(stacks, 'b');

flags/algorithms_sort.c

@@ -55,7 +55,7 @@ void	adaptive(t_stacks *stacks, char **tab)
 	while (!ft_isdigit(tab[i][0]) && tab[i])
 		i++;
 	disorder = stacks->disorder;
-	if (disorder < 0.3)
+	if (disorder < 0.2)
 		simple(stacks);
 	else if (disorder < 0.5)
 		medium(stacks);