mirror of
https://github.com/Ladebeze66/pushswap.git
synced 2025-12-15 21:56:54 +01:00
80 lines
2.0 KiB
C
Executable File
80 lines
2.0 KiB
C
Executable File
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* sort.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: fgras-ca <marvin@42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2023/07/31 18:13:21 by fgras-ca #+# #+# */
|
|
/* Updated: 2023/07/31 18:25:49 by fgras-ca ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include "push_swap.h"
|
|
|
|
static void push_all_save_three(t_stack **stack_a, t_stack **stack_b)
|
|
{
|
|
int stack_size;
|
|
int pushed;
|
|
int i;
|
|
|
|
stack_size = get_stack_size(*stack_a);
|
|
pushed = 0;
|
|
i = 0;
|
|
while (stack_size > 6 && i < stack_size && pushed < stack_size / 2)
|
|
{
|
|
if ((*stack_a)->index <= stack_size / 2)
|
|
{
|
|
do_pb(stack_a, stack_b);
|
|
pushed++;
|
|
}
|
|
else
|
|
do_ra(stack_a);
|
|
i++;
|
|
}
|
|
while (stack_size - pushed > 3)
|
|
{
|
|
do_pb(stack_a, stack_b);
|
|
pushed++;
|
|
}
|
|
}
|
|
|
|
static void shift_stack(t_stack **stack_a)
|
|
{
|
|
int lowest_pos;
|
|
int stack_size;
|
|
|
|
stack_size = get_stack_size(*stack_a);
|
|
lowest_pos = get_lowest_index_position(stack_a);
|
|
if (lowest_pos > stack_size / 2)
|
|
{
|
|
while (lowest_pos < stack_size)
|
|
{
|
|
do_rra(stack_a);
|
|
lowest_pos++;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
while (lowest_pos > 0)
|
|
{
|
|
do_ra(stack_a);
|
|
lowest_pos--;
|
|
}
|
|
}
|
|
}
|
|
|
|
void sort(t_stack **stack_a, t_stack **stack_b)
|
|
{
|
|
push_all_save_three(stack_a, stack_b);
|
|
tiny_sort(stack_a);
|
|
while (*stack_b)
|
|
{
|
|
get_target_position(stack_a, stack_b);
|
|
get_cost(stack_a, stack_b);
|
|
do_cheapest_move(stack_a, stack_b);
|
|
}
|
|
if (!is_sorted(*stack_a))
|
|
shift_stack(stack_a);
|
|
}
|