main.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   main.c                                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dnishsha <dnishsha@student.42berlin.d      +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2023/07/06 09:23:47 by dnishsha          #+#    #+#             */
/*   Updated: 2023/07/06 09:23:58 by dnishsha         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

/*void	print_list(t_stack_node *list, char *msg)
{
	t_stack_node	*current_node;

	current_node = list;
	printf("----------Stack %s---------\n", msg);
	while (current_node)
	{
		printf("Node %ld- %d target: %d push_price: %ld ",
			current_node->current_pos, current_node->value,
			current_node->target_node, current_node->push_price);
		printf("ra:%ld rb:%ld rr:%ld rra:%ld rrb:%ld prev: %p next: %p\n",
			current_node->ra, current_node->rb, current_node->rr,
			current_node->rra, current_node->rrb,
			current_node->prev, current_node->next);
		current_node = current_node->next;
	}
	printf("\n");
}*/

static void	sort(t_stack_node **a, t_stack_node **b)
{
	size_t			stack_length;

	stack_length = (ft_last_node(*a)->current_pos) + 1;
	if (stack_length == 2)
		sa(a);
	else if (stack_length == 3)
		small_sort(a);
	else if (stack_length > 3)
		big_sort(a, b);
}

int	main(int argc, char **argv)
{
	t_stack_node	*a;
	t_stack_node	*b;
	int				free_argv;

	free_argv = 0;
	a = NULL;
	b = NULL;
	if (argc == 1 || (argc == 2 && argv[1][0] == '\0' ))
		return (0);
	else if (argc == 2)
	{
		argv = ft_split(argv[1], ' ');
		free_argv = 1;
	}
	a = init_stack(a, argv, free_argv);
	if (is_stack_sorted(a))
		sort(&a, &b);
	free_all(a, argv, free_argv);
	return (0);
}