abandon optimisations et no more leaks
This commit is contained in:
22
srcs/algo.c
22
srcs/algo.c
@@ -119,23 +119,33 @@ void send_sublist_to_a(t_stack **a, t_stack **b, t_list *solution)
|
||||
mark_step(solution, "send_sublist_to_a");
|
||||
}
|
||||
|
||||
void hugo_sort(t_stack **a, t_stack **b, t_list *solution)
|
||||
void recursif_sort(t_stack **a, t_stack **b, t_list *solution)
|
||||
{
|
||||
if (sublist_size(*a) > 5)
|
||||
if (sublist_size(*a) > 4)
|
||||
divide_a(a, b, solution);
|
||||
else
|
||||
{
|
||||
|
||||
// sort_big(a, b, solution)
|
||||
// mini_sort(a, solution);
|
||||
minisort(a, solution);
|
||||
if (sublist_size(*b) > 5)
|
||||
mini_sort(a, solution);
|
||||
// minisort(a, solution);
|
||||
if (sublist_size(*b) > 4)
|
||||
divide_b(a, b, solution);
|
||||
else if (sublist_size(*b) > 0)
|
||||
send_sublist_to_a(a, b, solution);
|
||||
else
|
||||
return ;
|
||||
}
|
||||
hugo_sort(a, b, solution);
|
||||
recursif_sort(a, b, solution);
|
||||
}
|
||||
|
||||
void hugo_sort(t_stack **a, t_stack **b, t_list *solution)
|
||||
{
|
||||
if (sublist_size(*a) <= 3)
|
||||
special_sort_3(a, b, solution);
|
||||
else if (sublist_size(*a) <= 5)
|
||||
special_sort_5(a, b, solution);
|
||||
else
|
||||
recursif_sort(a, b, solution);
|
||||
}
|
||||
|
||||
|
||||
Reference in New Issue
Block a user