push_swap/checkstackb.c at master · yhadari/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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   checkstackb.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: yhadari <marvin@42.fr>                     +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2021/06/03 20:51:07 by yhadari           #+#    #+#             */
/*   Updated: 2021/06/06 14:57:28 by yhadari          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "pushswap.h"

t_info	get_info(t_info info)
{
	if (info.max > info.min)
	{
		info.size = info.sizemax;
		info.minomax = 1;
	}
	if (info.min > info.max)
	{
		info.size = info.sizemin;
		info.minomax = 0;
	}
	if (info.min == info.max)
	{
		if (info.sizemin > info.sizemax)
		{
			info.size = info.sizemin;
			info.minomax = 0;
		}
		if (info.sizemin < info.sizemax)
		{
			info.size = info.sizemax;
			info.minomax = 1;
		}
	}
	return (info);
}

void	get_index(t_stack *b, t_info *info, t_sort *tab, int *i)
{
	*i = b->top;
	*tab = sort(*b);
	info->min = tab->str[0];
	info->max = tab->str[b->top];
}

t_info	max_min(t_stack *b, t_sort *tab)
{
	int		i;
	t_info	info;

	get_index(b, &info, tab, &i);
	while (i >= 0)
	{
		if (b->data[i--] == info.max)
		{
			info.max = abs(i - b->top / 2 + 1);
			info.sizemax = i + 1;
			break ;
		}
	}
	i = b->top;
	while (i >= 0)
	{
		if (b->data[i--] == info.min)
		{
			info.min = abs(i - b->top / 2 + 1);
			info.sizemin = i + 1;
			break ;
		}
	}
	ft_free(tab);
	return (get_info(info));
}

void	rotate_min(int *size, t_stack *a, t_info info)
{
	if (info.minomax == 0)
	{
		(*size)++;
		ra(a, 1);
	}
}

void	checkstackb(t_stack *a, t_stack *b, t_info info, int *size)
{
	int		nb;

	nb = 0;
	if (info.size == b->top)
	{
		pa(a, b, 1);
		if (info.minomax == 0 && (*size)++)
			ra(a, 1);
	}
	else if (info.size != b->top)
	{
		if (info.size > b->top / 2)
		{
			find_rotate(info.size, a, b, 2);
			rotate_min(size, a, info);
		}
		else
		{
			nb = info.size;
			while (nb-- >= 0)
				rrb(b, 1);
			pa(a, b, 1);
			rotate_min(size, a, info);
		}
	}
}