libft
Loading...
Searching...
No Matches
ft_sorting.h
Go to the documentation of this file.
1
15#ifndef FT_SORTING_H
16#define FT_SORTING_H
17
30#define QSORT_THRESHOLD 10
32void ft_qsort(void* base, size_t nmemb, size_t size,
33 int (*cmp)(const void*, const void*));
34int double_cmp(const void* a, const void* b);
35int int_cmp(const void* a, const void* b);
36
// end of sorting_utils group
38
39#endif
void ft_qsort(void *base, size_t nmemb, size_t size, int(*cmp)(const void *, const void *))
Sorts an array using quicksort and insertion sort fallback.
Definition ft_qsort.c:242
int int_cmp(const void *a, const void *b)
Comparison function for two integers.
Definition ft_qsort.c:54
int double_cmp(const void *a, const void *b)
Comparison function for two doubles.
Definition ft_qsort.c:32