sorting.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   sorting.c                                          :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: dkaiser <dkaiser@student.42heilbronn.de    +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2024/04/13 15:04:19 by dkaiser           #+#    #+#             */
/*   Updated: 2024/04/16 17:54:16 by dkaiser          ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "libft/ft_printf.h"
#include "push_swap.h"

static int is_sorted(t_stack *stack)
{
    int i;

    if (stack->size < 2)
        return 1;
    i = 1;
    while (i < stack->size)
    {
        if (stack->stack[i] < stack->stack[i-1])
            return 0;
        i++;
    }
    return 1;
}

static void radixsort(t_psdata *data, int bit)
{
    int i;
    int size;

    i = 0;
    size = data->a->size;
    while (i < size)
    {
        if (data->a->size && ((data->a->stack[0] >> bit) & 1) == 0)
            run_command(data, PB);
        else if (data->a->size > 1)
            run_command(data, RA);
        i++;
    }
    while (data->b->size > 0)
        run_command(data, PA);
    if (!is_sorted(data->a))
        radixsort(data, bit + 1);
}

void stack_sort(t_psdata *data)
{
    radixsort(data, 0);
}