Push_Swap/sort_three.c at master · lsmienk/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
/* ************************************************************************** */
/*                                                                            */
/*                                                        ::::::::            */
/*   sort_three.c                                       :+:    :+:            */
/*                                                     +:+                    */
/*   By: lorenasmienk <lorenasmienk@student.coda      +#+                     */
/*                                                   +#+                      */
/*   Created: 2019/12/26 12:42:18 by lorenasmien    #+#    #+#                */
/*   Updated: 2020/01/02 17:12:09 by lsmienk       ########   odam.nl         */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

static void		min_first(t_setting *set, t_stack *ar, char x)
{
	if (ar->len == 3)
	{
		rev_rotate(ar, x);
		swap(set, x);
	}
	else
	{
		rotate(ar, x);
		swap(set, x);
		rev_rotate(ar, x);
	}
}

static void		mid_first(t_setting *set, t_stack *ar, char x)
{
	if (ar->len == 3)
	{
		if (ar->stack[ar->len - 3] == ar->min)
			rev_rotate(ar, x);
		else
			swap(set, x);
	}
	else
	{
		if (ar->stack[ar->len - 3] == ar->min)
		{
			rotate(ar, x);
			swap(set, x);
			rev_rotate(ar, x);
		}
		swap(set, x);
	}
}

static void		max_first(t_setting *set, t_stack *ar, char x)
{
	if (ar->len == 3)
	{
		if (ar->stack[ar->len - 2] == ar->min)
			rotate(ar, x);
		else
		{
			swap(set, x);
			rev_rotate(ar, x);
		}
	}
	else
	{
		swap(set, x);
		if (ar->stack[ar->len - 1] == ar->min)
			min_first(set, ar, x);
		else
			mid_first(set, ar, x);
	}
}

void			sort_three(t_setting *set, t_stack *ar, char x)
{
	if (is_sorted(ar, 3))
		return ;
	set_min_max(ar, 3);
	if (ar->stack[ar->len - 1] == ar->max)
		max_first(set, ar, x);
	else if (ar->stack[ar->len - 1] == ar->min)
		min_first(set, ar, x);
	else
		mid_first(set, ar, x);
}