-
Notifications
You must be signed in to change notification settings - Fork 0
/
radix_sort.c
58 lines (51 loc) · 1.55 KB
/
radix_sort.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
57
58
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* radix_sort.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: mskeleto <[email protected]> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2021/10/06 17:32:38 by mskeleto #+# #+# */
/* Updated: 2021/10/07 00:22:40 by mskeleto ### ########.fr */
/* */
/* ************************************************************************** */
#include "ps.h"
int ft_radix_sort(t_stack *a, t_stack *b, int val)
{
int max_bit;
t_utils utils;
int i;
max_bit = ft_find_mb(val - 1);
utils.bit = -1;
while (++(utils.bit) < max_bit)
{
i = 0;
while (i++ < val)
ft_put_elems_to_b(a, b, val, utils);
while (b[0].str != NULL)
ft_pa(a, b, val);
}
return (0);
}
int ft_find_mb(int val)
{
int max_bit;
max_bit = 0;
while (val >> max_bit != 0)
++max_bit;
return (max_bit);
}
int ft_put_elems_to_b(t_stack *a, t_stack *b, int val, t_utils utils)
{
int j;
int tmp;
j = 0;
while (a[j + 1].str != NULL)
j++;
tmp = a[j].id;
if (((tmp >> utils.bit) & 1) == 1)
ft_ra(a, val);
else
ft_pb(a, b, val);
return (0);
}