/*
sort_stack Copyright (C) 2026 yctct

This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program.  If not, see <https://www.gnu.org/licenses/>.
*/


#include "../include/push_swap.h"

void	sort_three(t_list **stack)
{
	t_list	*node;
	int		first;
	int		second;
	int		third;

	node = *stack;
	first = node->value;
	second = node->next->value;
	third = node->next->next->value;
	if ((first > second) && (first < third))
		sa(stack);
	else if ((first > second) && (first > third))
	{
		sa(stack);
		sort_three(stack);
	}
	else if ((third < second) && (third < first))
		rra(stack);
	else if ((third < second) && (third > first))
	{
		rra(stack);
		sort_three(stack);
	}
	else if ((third < second) && (third == first))
		rra(stack);
}