tvdu29/push_swap
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Sorry for that last one =S

Browse Source 
working sort not optimised
need to work on checker read to get one line
This commit is contained in:
vagrant 2019-03-06 16:33:03 +00:00
parent 770bfc428d
commit 3fc361618c
1 changed files with 30 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

57
srcs/push_swap.c
View File

@ -6,7 +6,7 @@
/* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */ /* By: tmaze <tmaze@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */ /* +#+#+#+#+#+ +#+ */
/* Created: 2019/03/03 11:41:49 by tmaze #+# #+# */ /* Created: 2019/03/03 11:41:49 by tmaze #+# #+# */
/* Updated: 2019/03/06 12:10:10 by tmaze ### ########.fr */ /* Updated: 2019/03/06 16:24:16 by tmaze ### ########.fr */
/* */ /* */
/* ************************************************************************** */ /* ************************************************************************** */
@ -17,7 +17,6 @@ int sort(t_psdata *data, int size)
t_stack *ptr; t_stack *ptr;
int i; int i;
printf("start sort %d\n", size);
if (size > 2) if (size > 2)
{ {
if (!sort(data, ((size % 2) ? size + 1 : size) / 2)) if (!sort(data, ((size % 2) ? size + 1 : size) / 2))
@ -26,7 +25,18 @@ int sort(t_psdata *data, int size)
return (0); return (0);
} }
else if (size == 1) else if (size == 1)
{
printf("ra\n");
ps_rot(data, 'a');
return (1); return (1);
}
i = 0;
while (size > 2 && i < size)
{
printf("rra\n");
ps_rerot(data, 'a');
i++;
}
i = 0; i = 0;
ptr = data->a; ptr = data->a;
while (i < ((size % 2) ? size + 1 : size) / 2) while (i < ((size % 2) ? size + 1 : size) / 2)
@ -42,14 +52,6 @@ int sort(t_psdata *data, int size)
ptr = ptr->next; ptr = ptr->next;
i++; i++;
} }
i = 0;
ptr = data->a;
while (ptr)
{
printf("@ind %d: nb=%d ind=%d\n", i, ptr->nb, ptr->ind);
ptr = ptr->next;
i++;
}
while (data->a->ind == 1) while (data->a->ind == 1)
{ {
printf("pb\n"); printf("pb\n");
@ -63,25 +65,15 @@ int sort(t_psdata *data, int size)
} }
while (data->a->ind != 0 || data->size_b > 0) while (data->a->ind != 0 || data->size_b > 0)
{ {
printf("data->a->ind %d\ndata->a->nb %d\ndata->size_b %zu\n", data->a->ind, data->a->nb, data->size_b);
if ((data->a->ind != 0 && data->size_b > 0 && data->a->nb > data->b->nb) if ((data->a->ind != 0 && data->size_b > 0 && data->a->nb > data->b->nb)
|| (data->a->ind == 0 && data->size_b > 0)) || (data->a->ind == 0 && data->size_b > 0))
{ {
printf("pa\n"); printf("pa\n");
ps_push(data, 'a'); ps_push(data, 'a');
} }
printf("mise a zero:\ndata->a->ind %d\ndata->a->nb %d\n", data->a->ind, data->a->nb);
data->a->ind = 0; data->a->ind = 0;
printf("ra\n"); printf("ra\n");
ps_rot(data, 'a'); ps_rot(data, 'a');
i = 0;
ptr = data->a;
while (ptr)
{
printf("@ind %d: nb=%d ind=%d\n", i, ptr->nb, ptr->ind);
ptr = ptr->next;
i++;
}
} }
return (1); return (1);
} }
@ -90,6 +82,7 @@ int main(int ac, char **av)
{ {
t_stack *ptr; t_stack *ptr;
t_psdata data; t_psdata data;
int i;
ps_initdata(&data); ps_initdata(&data);
if (!get_params(&data, ac, av)) if (!get_params(&data, ac, av))
@ -108,12 +101,22 @@ int main(int ac, char **av)
ps_stkclean(&data); ps_stkclean(&data);
return (1); return (1);
} }
ptr = data.a; /* ptr = data.a; */
while (ptr) /* i = data.a->nb; */
{ /* while (ptr) */
printf("%d\n", ptr->nb); /* { */
ptr->ind = 0; /* printf("%d\n", ptr->nb); */
ptr = ptr->next; /* ptr->ind = 0; */
} /* if (i != ptr->nb && i > ptr->nb) */
/* { */
/* printf("KO\n"); */
/* break ; */
/* } */
/* i = ptr->nb; */
/* ptr = ptr->next; */
/* } */
/* if (ptr == NULL) */
/* printf("OK\n"); */
/* ps_stkclean(&data); */
return (0); return (0);
} }