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

need to fix

Browse Source
This commit is contained in:
Maoake Teriierooiterai
2026-01-15 18:42:15 +01:00
parent 469320374d
commit afa8785379
10 changed files with 1633 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
algorithms/medium/sort_utils.c
View File

@@ -12,6 +12,22 @@
#include "push_swap.h"
#include "medium_headers.h"
#include <stdio.h>
static int move_next(t_stack *tmp, int value)
{
int i;
i = 0;
if (tmp->previous->value < value)
return (70000);
while (tmp->value < value)
{
tmp = tmp->next;
i++;
}
return (i);
}
static int number_move_reverse(t_stacks *stacks, int value, char start_end)
{
@@ -22,11 +38,7 @@ static int number_move_reverse(t_stacks *stacks, int value, char start_end)
tmp = stacks->a;
if (start_end == 's')
{
while (tmp->value < value)
{
tmp = tmp->next;
i++;
}
i = move_next(tmp, value);
}
else
{
@@ -40,7 +52,7 @@ static int number_move_reverse(t_stacks *stacks, int value, char start_end)
return (i);
}
static int sort_path(t_stacks *stacks, int value)
int sort_path(t_stacks *stacks, int value)
{
int start_path;
int end_path;
@@ -75,10 +87,25 @@ static void sort_little_pile(t_stacks *stacks)
void push_range_to_b(t_stacks *stacks, t_tab *one_preset, int range)
{
int value;
int i;
i = 0;
while (one_preset->nb_in > 0)
{
if (i > 0)
{
value = get_value_finded(stacks, one_preset, range);
opti_path(stacks, one_preset, range, value);
}
normal_move_path(stacks, one_preset, range);
opti2_move_path(stacks, one_preset, range);
sort_little_pile(stacks);
while (stacks->a->value > stacks->a->previous->value)
ra(stacks);
one_preset->nb_in--;
i++;
if (!check_order(stacks->a))
return ;
}
}