42_push_swap/sorting_techniques.c at main · JulioHOR/42_push_swap · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   sorting_techniques.c                               :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: juhenriq <dev@juliohenrique.com>           +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2025/04/02 01:38:15 by juhenriq          #+#    #+#             */
/*   Updated: 2025/04/02 01:38:16 by juhenriq         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

void	turks_algorithm(t_stacks *stacks)
{
	if (is_stack_sorted(stacks))
		return ;
	turks_initial_movements(stacks);
	while (stacks->stack_a.highest_idx_used > 2)
	{
		set_target_for_every_element(TARGET_STACK_B, stacks);
		define_movement_costs(TARGET_STACK_B, stacks);
		move_most_fit_elem_and_its_target_to_top(TARGET_STACK_B, stacks);
		pb(stacks);
	}
	if (sort_two_elem(stacks))
		return ;
	sort_the_three_elements_on_stack_a(stacks);
	if (is_b_empty(&(stacks->stack_b)))
		return ;
	while (!(is_stack_sorted(stacks)))
	{
		set_target_for_every_element(TARGET_STACK_A, stacks);
		define_movement_costs(TARGET_STACK_A, stacks);
		if (stacks->stack_b.highest_idx_used > -1)
			move_most_fit_elem_and_its_target_to_top(TARGET_STACK_A, stacks);
		pa(stacks);
		if (is_b_empty(&(stacks->stack_b)))
			move_min_nb_to_top(stacks);
	}
}

void	five_elem_strategy(t_stacks *stacks)
{
	if (is_stack_sorted(stacks))
		return ;
	move_elem_to_top(get_idx_of_smallest_nb(&(stacks->stack_a)),
		&(stacks->stack_a), stacks);
	pb(stacks);
	move_elem_to_top(get_idx_of_smallest_nb(&(stacks->stack_a)),
		&(stacks->stack_a), stacks);
	pb(stacks);
	sort_the_three_elements_on_stack_a(stacks);
	pa(stacks);
	pa(stacks);
}