main.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   main.c                                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: meskelin <meskelin@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/01/20 17:43:22 by meskelin          #+#    #+#             */
/*   Updated: 2023/03/31 10:08:27 by meskelin         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "./includes/push_swap.h"

static int	is_sorted(t_list *stack)
{
	if (!stack->next)
		return (1);
	while (stack)
	{
		if (stack->next && stack->data >= stack->next->data)
			return (0);
		stack = stack->next;
	}
	return (1);
}

static int	has_duplicates(t_list **stack)
{
	t_list	*temp_a;
	t_list	*temp_b;

	temp_a = *stack;
	temp_b = temp_a->next;
	while (temp_a)
	{
		while (temp_b)
		{
			if (temp_a->data == temp_b->data)
				return (1);
			temp_b = temp_b->next;
		}
		temp_a = temp_a->next;
		if (temp_a && temp_a->next)
			temp_b = temp_a->next;
	}
	return (0);
}

void	sort(t_list **stack)
{
	int		max_count;
	int		part_count;
	int		algorithm;

	algorithm = 0;
	part_count = 0;
	if (is_sorted(*stack))
	{
		clearall_throw(stack, NULL, NULL, 0);
		exit_success();
	}
	if (has_duplicates(stack))
		exit_failure(stack, NULL, NULL);
	max_count = lstsize(*stack);
	algorithm = select_algorithm(max_count);
	part_count = select_part_count(algorithm, max_count);
	sort_stack(stack, algorithm, part_count);
}

int	main(int argc, char *argv[])
{
	int		i;
	t_list	*stack;

	if (argc < 2 || (argc == 2 && argv[1][0] == '\0'))
		return (0);
	i = 1;
	while (argv[i])
	{
		stack = create_stack(argv[i]);
		if (!stack && !argv[i + 1])
			exit_success();
		i++;
	}
	sort(&stack);
	return (0);
}