jack/42-archive
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

better insert sort

Browse source
This commit is contained in:
Antoine Riard 2017-05-20 20:06:38 +02:00
parent 6271ccc06e
commit 61a1acc283
2 changed files with 15 additions and 28 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
libftasm/includes/lst.h
View file

@ -6,7 +6,7 @@
/* By: jhalford <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2016/11/07 13:27:46 by jhalford #+# #+# */
/* Updated: 2017/05/19 18:51:36 by ariard ### ########.fr */
/* Updated: 2017/05/20 20:01:20 by ariard ### ########.fr */
/* */
/* ************************************************************************** */
@ -86,6 +86,6 @@ t_list *ft_id(t_list *a);
t_list *ft_lst_at(t_list *list, unsigned int nbr);
void lst_insert_sort(t_list **head,
int (cmp)(void *elem1, void *elem2));
int (cmp)());
#endif

39
libftasm/srcs/lst/lst_insert_sort.c
View file

@ -1,42 +1,29 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* lst_inser_sort.c :+: :+: :+: */
/* lst_insert_sort.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: ariard <ariard@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2017/05/19 17:59:14 by ariard #+# #+# */
/* Updated: 2017/05/19 18:56:53 by ariard ### ########.fr */
/* Created: 2017/05/20 19:59:41 by ariard #+# #+# */
/* Updated: 2017/05/20 20:05:32 by ariard ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft.h"
void lst_insert_sort(t_list **head,
int (cmp)(void *elem1, void *elem2))
void lst_insert_sort(t_list **head,
int (cmp)())
{
t_list **indirect;
t_list *ins;
t_list *tmp;
t_list *new;
t_list *ptr;
indirect = head;
while (indirect && *indirect && (*indirect)->next)
new = NULL;
while (*head)
{
ins = *head;
if ((cmp)(*indirect, (*indirect)->next) > 0)
while (ins->next)
{
if ((cmp)(*indirect, ins->next) < 0)
{
tmp->next = (*indirect)->next;
(*indirect)->next = ins->next;
ins->next = (*indirect);
indirect = &tmp;
break;
}
ins = ins->next;
}
tmp = *indirect;
indirect = &(*indirect)->next;
ptr = *head;
*head = (*head)->next;
ft_lst_sorted_insert(&new, ptr, cmp);
}
*head = new;
}