blob: 995785fd38dc36ffd12c9bd711f72fadce9b08e9 (
plain)
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
|
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* ft_lstsorted_merge.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2020/02/10 01:58:52 by cacharle #+# #+# */
/* Updated: 2020/02/16 02:18:11 by cacharle ### ########.fr */
/* */
/* ************************************************************************** */
#include "libft_lst.h"
/*
** \brief Merge sorted lists, the new list is also sorted
** \param l1 First list
** \param l2 Second list
** \param cmp Comparison function, <0 if less, 0 if equal, >0 if greater
** \return Pointer to first node of merged list
*/
t_ftlst *ft_lstsorted_merge(t_ftlst *l1, t_ftlst *l2, t_ftcompar_func cmp)
{
t_ftlst *merged;
merged = NULL;
if (l1 == NULL)
return (l2);
if (l2 == NULL)
return (l1);
if (cmp(l1->data, l2->data) < 0)
{
merged = l1;
merged->next = ft_lstsorted_merge(l1->next, l2, cmp);
}
else
{
merged = l2;
merged->next = ft_lstsorted_merge(l1, l2->next, cmp);
}
return (merged);
}
|
