diff options
| author | nass1pro <nass1pro@gmail.com> | 2020-06-09 19:48:34 +0200 |
|---|---|---|
| committer | nass1pro <nass1pro@gmail.com> | 2020-06-13 11:31:00 +0200 |
| commit | 579a26f5593039ffbbd1a81e45ecf0ef8797cb5d (patch) | |
| tree | c5b6761db98e27d15bab3fb45ba9e0a646cf06e0 /test_mini/libft/src/algo/ft_heapsort.c | |
| parent | 9fabc25a980550afc6337fd729632462f2680daa (diff) | |
| download | minishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.tar.gz minishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.tar.bz2 minishell-579a26f5593039ffbbd1a81e45ecf0ef8797cb5d.zip | |
add lexer
add single quote
Diffstat (limited to 'test_mini/libft/src/algo/ft_heapsort.c')
| -rw-r--r-- | test_mini/libft/src/algo/ft_heapsort.c | 54 |
1 files changed, 54 insertions, 0 deletions
diff --git a/test_mini/libft/src/algo/ft_heapsort.c b/test_mini/libft/src/algo/ft_heapsort.c new file mode 100644 index 0000000..d309624 --- /dev/null +++ b/test_mini/libft/src/algo/ft_heapsort.c @@ -0,0 +1,54 @@ +/* ************************************************************************** */ +/* */ +/* ::: :::::::: */ +/* ft_heapsort.c :+: :+: :+: */ +/* +:+ +:+ +:+ */ +/* By: cacharle <marvin@42.fr> +#+ +:+ +#+ */ +/* +#+#+#+#+#+ +#+ */ +/* Created: 2020/02/10 02:59:22 by cacharle #+# #+# */ +/* Updated: 2020/02/10 04:22:19 by cacharle ### ########.fr */ +/* */ +/* ************************************************************************** */ + +#include "libft_algo.h" + +/* static void st_build_max_heap(void *base, size_t nel, size_t width, */ +/* int (*compar)(const void *, const void *)) */ +/* { */ +/* int i; */ +/* */ +/* i = 1; */ +/* while (i < nel) */ +/* { */ +/* compar(base + i * width, base + 2 * i * width) */ +/* */ +/* i++; */ +/* } */ +/* } */ +/* */ +/* static void st_heapify(void *base, size_t nel, size_t width, */ +/* int (*compar)(const void *, const void *)) */ +/* { */ +/* */ +/* } */ + +int ft_heapsort(void *base, size_t nel, size_t width, + int (*compar)(const void *, const void *)) +{ + (void)base; + (void)nel; + (void)width; + (void)compar; + /* size_t i; */ + /* */ + /* if (nel < 2) */ + /* return (0); */ + /* st_build_max_heap(base, nel, width, compar); */ + /* i = -1; */ + /* while (++i < nel) */ + /* { */ + /* ft_memswap(base, base + (nel - i - 1) * width); */ + /* st_heapify(base, nel - i - 1, width, compar); */ + /* } */ + return (0); +} |