sort.c

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   sort.c                                             :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: moabed <moabed@student.42amman.com>        +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2025/11/24 21:05:24 by moabed            #+#    #+#             */
/*   Updated: 2025/12/16 09:30:08 by moabed           ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "push_swap.h"

static void	maping(int *nums, t_stack **stack_a)
{
	t_stack	*ptr;
	int		i;
	int		size;

	size = ft_lstsize((*stack_a));
	ptr = (*stack_a);
	while (ptr)
	{
		i = 0;
		while (i < size)
		{
			if (nums[i] == ptr->content)
			{
				ptr->content = i;
				break ;
			}
			i++;
		}
		ptr = ptr->next;
	}
	free(nums);
}

static void	indexing(t_stack **stack_a)
{
	int		*nums;
	t_stack	*ptr;
	int		i;
	int		n;

	i = 0;
	n = ft_lstsize((*stack_a));
	nums = malloc(sizeof(int) * n);
	if (!nums)
	{
		freelist(stack_a);
		exit(1);
	}
	ptr = (*stack_a);
	while (ptr)
	{
		nums[i++] = ptr->content;
		ptr = ptr->next;
	}
	nums = bubblesort(nums, n);
	maping(nums, stack_a);
}

void	radixsort(t_stack **stack_a, t_stack **stack_b)
{
	int	*largest;
	int	i;
	int	j;

	i = 0;
	indexing(stack_a);
	largest = findlargest(*stack_a);
	if (!largest)
		freelists(stack_a, stack_b);
	while (i < largest[1])
	{
		j = 0;
		while (j++ <= largest[0])
		{
			if (((*stack_a)->content >> i) % 2 == 0)
				pb(stack_b, stack_a);
			else
				ra(stack_a, 1);
		}
		while (ft_lstsize((*stack_b)))
			pa(stack_a, stack_b);
		i++;
	}
	free(largest);
}