push_utilis.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   push_utilis.c                                      :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: mohkhald <mohkhald@student.1337.ma>        +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2025/04/02 21:11:56 by mohkhald          #+#    #+#             */
/*   Updated: 2025/04/05 03:53:46 by mohkhald         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

int	ft_stack_size(t_stack *stack)
{
	int	i;

	i = 0;
	while (stack)
	{
		i++;
		stack = stack->next;
	}
	return (i);
}

int	ft_is_sorted(t_stack *a)
{
	if (!a)
		return (0);
	while (a->next)
	{
		if (a->value > a->next->value)
			return (0);
		a = a->next;
	}
	return (1);
}

void	ft_sort_stack(t_stack **a, t_stack **b)
{
	int	size;

	ft_set_index(a);
	size = ft_stack_size(*a);
	if (size <= 3)
		ft_sort_three(a);
	else if (size == 5 || size == 4)
		ft_sort_five(a, b);
	else if (size <= 100)
		ft_sort_stack_rang(a, b, 13);
	else if (size > 100 && size <= 500)
		ft_sort_stack_rang(a, b, 30);
	else
		ft_sort_stack_rang(a, b, 40);
}

int	ft_max_index(t_stack *stack)
{
	int	i;
	int	max_index;
	int	tmp;

	max_index = 0;
	i = 0;
	if (!stack)
		return (-1);
	tmp = stack->value;
	while (stack)
	{
		if (tmp < stack->value)
		{
			max_index = i;
			tmp = stack->value;
		}
		i++;
		stack = stack->next;
	}
	return (max_index);
}